Sciweavers

1087 search results - page 102 / 218
» Generation under Space Constraints
Sort
View
CP
2004
Springer
15 years 4 months ago
Concurrent Dynamic Backtracking for Distributed CSPs
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
Roie Zivan, Amnon Meisels
SIAMCO
2002
78views more  SIAMCO 2002»
15 years 20 days ago
Strong Optimality for a Bang-Bang Trajectory
In this paper we give sufficient conditions for a bang-bang regular extremal to be a strong local optimum for a control problem in the Mayer form; strong means that we consider the...
Andrei A. Agrachev, Gianna Stefani, PierLuigi Zezz...
IJRR
2011
174views more  IJRR 2011»
14 years 8 months ago
Bounding on rough terrain with the LittleDog robot
— In this paper we develop an RRT-based motion planner that achieved bounding in simulation with the LittleDog robot over extremely rough terrain. LittleDog is a quadruped robot ...
Alexander C. Shkolnik, Michael Levashov, Ian R. Ma...
GIS
1995
ACM
15 years 4 months ago
A Window Retrieval Algorithm for Spatial Databases Using Quadtrees
An algorithm is presented to answer window queries in a quadtree-based spatial database environment by retrieving the covering blocks in the underlying spatial database. It works ...
Walid G. Aref, Hanan Samet
104
Voted
COR
2010
123views more  COR 2010»
15 years 1 months ago
Decomposition, reformulation, and diving in university course timetabling
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, ...