2109 search results - page 167 / 422 » Solving Necklace Constraint Problems |
156
click to vote
ATMOS
2007
15 years 7 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
161
click to vote
AAAI
2006
15 years 7 months ago
2006
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
120
click to vote
ATAL
2004
Springer
15 years 11 months ago
2004
Springer
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
133
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
140
click to vote
AIPS
2006
15 years 7 months ago
2006
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...