1197 search results - page 78 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
164
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading, under the general assumption that the jammer has no...
128
click to vote
EOR
2007
15 years 5 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
137
click to vote
SIGGRAPH
2010
ACM
15 years 9 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
159
click to vote
ATMOS
2007
15 years 7 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
187
click to vote
ATAL
2009
Springer
16 years 2 days ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...