1102 search results - page 200 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
192
click to vote
CRV
2011
IEEE
14 years 7 days ago
2011
IEEE
—We consider the problem of exploring an unknown environment with a pair of mobile robots. The goal is to make the robots meet (or rendezvous) in minimum time such that there is ...
GLOBECOM
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...
SCALESPACE
2007
Springer
15 years 6 months ago
2007
Springer
In this work, we address the problem of segmenting multiple objects, under possible occlusions, in a level set framework. A variational energy that incorporates a piecewise constan...
113
Voted
SOCO
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In addition to publishing composite services as reusable services, compositions can also be reused by applying them to orchestrate different component services. To do so...
AGENTS
1998
Springer
15 years 4 months ago
1998
Springer
of other components. This abstract presents an implemented illustration of such explicit component synergy and its usefulness in dynamic multi-agent environments. In such environme...