707 search results - page 86 / 142 » Solving path problems on the GPU |
115
click to vote
CONSTRAINTS
2006
14 years 12 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...
101
click to vote
JAIR
2006
14 years 11 months ago
2006
In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal planning problems and its implementation in the SGPlan4 planner. Based on the strong...
108
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
108
click to vote
FSTTCS
2008
Springer
15 years 27 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...
102
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...