Sciweavers

501 search results - page 16 / 101
» date 2007
Sort
View
CONCUR
2007
Springer
15 years 3 months ago
Solving Games Via Three-Valued Abstraction Refinement
Games via Three-Valued Abstraction Refinement Luca de Alfaro, Pritam Roy PII: S0890-5401(10)00018-0 DOI: 10.1016/j.ic.2009.05.007 Reference: YINCO 3711 To appear in: Information an...
Luca de Alfaro, Pritam Roy
ACTA
1998
111views more  ACTA 1998»
14 years 9 months ago
Machine Scheduling with Availability Constraints
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Eric Sanlaville, Günter Schmidt
ICGA
2007
90views Optimization» more  ICGA 2007»
14 years 9 months ago
Game Over: Black to Play and Draw in Checkers
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
Jonathan Schaeffer
DISOPT
2007
81views more  DISOPT 2007»
14 years 9 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
DAIS
2006
14 years 11 months ago
A Versatile Kernel for Distributed AOP
Abstract. Aspect-Oriented Programming (AOP) promotes better separation of concerns in software systems by introducing aspects for the modular implementation of crosscutting concern...
Éric Tanter, Rodolfo Toledo