383 search results - page 8 / 77 » Common Subexpressions in Constraint Models of Planning Probl... |
130
click to vote
ICRA
2010
IEEE
15 years 11 days 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
click to vote
EUROCAST
1994
Springer
15 years 6 months ago
1994
Springer
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
170
Voted
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Tools for generating test queries for databases do not explicitly take into account the actual data in the database. As a consequence, such tools cannot guarantee suitable coverag...
157
click to vote
AAAI
2008
15 years 4 months ago
2008
When controlling dynamic systems, such as mobile robots in uncertain environments, there is a trade off between risk and reward. For example, a race car can turn a corner faster b...
131
Voted
EAAI
2008
15 years 1 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...