6456 search results - page 212 / 1292 » Constraint Solving on Terms |
215
click to vote
AAAI
2008
15 years 8 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...
195
click to vote
AIPS
2007
15 years 8 months ago
2007
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
214
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
182
click to vote
IPCO
2008
15 years 8 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
181
click to vote
AIR
2004
15 years 6 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...