Multi-interval heuristics for accelerating target-value search

Multi-interval heuristics for accelerating target-value search

Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: DEKLEER, JOHAN, ZHOU, RONG, KUHN, LUKAS, SCHMIDT, TIM, PRICE, ROBERT R
Format: Patent
Sprache:eng ; fre ; ger
Schlagworte:
CALCULATING
COMPUTING
COUNTING
DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Methods and systems for solving a target value search problem using a multi-interval heuristic are presented. The methods and system identity a path, or paths, in a graph, whereby a connection graph is created and range sets are generated for each vertex in the connection graph. Range sets include one or more intervals. Thereafter, a best search is performed to identify a path, or paths, from a starting vertex to a goal vertex having a path value closest to a target value.