Sciweavers

2004 search results - page 57 / 401
» Sampling from large graphs
Sort
View
AAAI
2000
15 years 1 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati
DILS
2006
Springer
15 years 3 months ago
Link Discovery in Graphs Derived from Biological Databases
Public biological databases contain vast amounts of rich data that can also be used to create and evaluate new biological hypothesis. We propose a method for link discovery in biol...
Petteri Sevon, Lauri Eronen, Petteri Hintsanen, Ki...
GIS
2009
ACM
16 years 26 days ago
Map-Matching for Low-Sampling-Rate GPS Trajectories
Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications...
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei ...
WSC
2004
15 years 1 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja
RTAS
1998
IEEE
15 years 4 months ago
Managing Memory Requirements in the Synthesis of Real-Time Systems from Processing Graphs
In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems...
Steve Goddard, Kevin Jeffay