566 search results - page 72 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
ISCAS
2003
IEEE
15 years 5 months ago
2003
IEEE
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
107
Voted
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract— To compute collision-free and dynamicallyfeasibile trajectories that satisfy high-level specifications given in a planning-domain definition language, this paper prop...
125
Voted
FLAIRS
2004
15 years 1 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
112
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
103
click to vote
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...