Sciweavers

4166 search results - page 75 / 834
» Automating the constraining process
Sort
View
CP
2009
Springer
15 years 10 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
GLOBECOM
2007
IEEE
15 years 4 months ago
Constrained Stochastic Games in Wireless Networks
—We consider the situation where N nodes share a common access point. With each node i there is an associated buffer and channel state that change in time. Node i dynamically cho...
Eitan Altaian, Konstantin Avrachenkov, Nicolas Bon...
IROS
2007
IEEE
266views Robotics» more  IROS 2007»
15 years 4 months ago
Incremental multi-robot task selection for resource constrained and interrelated tasks
— When the tasks of a mission are interrelated and subject to several resource constraints, more efforts are needed to coordinate robots towards achieving the mission than indepe...
Sanem Sariel, Tucker R. Balch, Nadia Erdogan
QSHINE
2005
IEEE
15 years 3 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 3 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...