Sciweavers

4081 search results - page 726 / 817
» The Impact of Constraint Programming
Sort
View
CP
2003
Springer
15 years 5 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
99
Voted
CP
2003
Springer
15 years 5 months ago
CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions
Abstract. Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items...
Alessio Guerri, Michela Milano
AINA
2010
IEEE
15 years 5 months ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
103
Voted
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 5 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
92
Voted
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
15 years 5 months ago
Design of Asymptotically Stable Walking for a 5-Link Planar Biped Walker via Optimization
— Closed-loop, asymptotically stable walking motions are designed for a 5-link, planar bipedal robot model with one degree of underactuation. Parameter optimization is applied to...
E. R. Westervelt, J. W. Grizzle