335 search results - page 45 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
115
click to vote
CONSTRAINTS
2006
14 years 11 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
106
click to vote
FSTTCS
2008
Springer
15 years 24 days ago
2008
Springer
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
113
click to vote
ICN
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
105
click to vote
ICRA
2010
IEEE
14 years 10 months ago
2010
IEEE
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
MATES
2010
Springer
14 years 10 months ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...