Sciweavers

793 search results - page 95 / 159
» Analogical Path Planning
Sort
View
COMPGEOM
1998
ACM
14 years 4 days ago
Design and Analysis of Planar Shape Deformation
Shape deformation refers to the continuous change of one geometric object to another. We develop a software tool for planning, analyzing, and visualizing deformations between two ...
Siu-Wing Cheng, Herbert Edelsbrunner, Ping Fu, Ka-...
ICDE
2003
IEEE
170views Database» more  ICDE 2003»
14 years 9 months ago
Keyword Proximity Search on XML Graphs
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...
Vagelis Hristidis, Yannis Papakonstantinou, Andrey...
DATE
2003
IEEE
79views Hardware» more  DATE 2003»
14 years 1 months ago
Time Budgeting in a Wireplanning Context
Wireplanning is an approach in which the timing of inputoutput paths is planned before modules are specified, synthesized or sized. If these global wires are optimally segmented ...
Jurjen Westra, Dirk-Jan Jongeneel, Ralph H. J. M. ...
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
13 years 10 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling