192 search results - page 31 / 39 » On-Demand Bound Computation for Best-First Constraint Optimi... |
SSD
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
AIPS
2006
14 years 11 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
TCS
2008
14 years 9 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
81
Voted
DATE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
162
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
The growing nature of databases, and the flexibility inherent in the SQL query language that allows arbitrarily complex formulations, can result in queries that take inordinate am...