Sciweavers

297 search results - page 33 / 60
» Polynomial heuristics for query optimization
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
CORR
2008
Springer
74views Education» more  CORR 2008»
13 years 7 months ago
Analysis of the Karmarkar-Karp Differencing Algorithm
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
Stefan Boettcher, Stephan Mertens
16
Voted
ASPDAC
2000
ACM
97views Hardware» more  ASPDAC 2000»
14 years 4 days ago
Symbolic debugging of globally optimized behavioral specifications
Symbolic debuggers are system development tools that can accelerate the validation speed of behavioral specifications by allowing a user to interact with an executing code at the ...
Inki Hong, Darko Kirovski, Miodrag Potkonjak, Mari...
IGIS
1994
156views GIS» more  IGIS 1994»
13 years 12 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
13 years 5 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...