566 search results - page 51 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
AAAI
1998
15 years 1 months ago
1998
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
VLSID
2003
IEEE
16 years 26 days ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
104
click to vote
CONSTRAINTS
2002
15 years 9 days ago
2002
In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for So...
HICSS
1994
IEEE
15 years 4 months ago
1994
IEEE
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
104
click to vote
TSMC
2010
14 years 7 months ago
2010
In this paper, we present two near-optimal methods to determine the real-time collision-free path for a mobile vehicle moving in a dynamically changing environment. The proposed de...