Sciweavers

2286 search results - page 300 / 458
» Algorithms for Categorical Equivalence
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 10 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
CPAIOR
2006
Springer
15 years 10 months ago
Online Stochastic Reservation Systems
This paper considers online stochastic reservation problems, where requests come online and must be dynamically allocated to limited resources in order to maximize profit. Multi-k...
Pascal Van Hentenryck, Russell Bent, Yannis Vergad...
CONCUR
2008
Springer
15 years 8 months ago
Strategy Construction for Parity Games with Imperfect Information
We consider imperfect-information parity games in which strategies rely on observations that provide imperfect information about the history of a play. To solve such games, i.e., t...
Dietmar Berwanger, Krishnendu Chatterjee, Laurent ...
ESOP
2008
Springer
15 years 8 months ago
Regular Expression Subtyping for XML Query and Update Languages
Abstract. XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be...
James Cheney
AAAI
1998
15 years 8 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...