Sciweavers

3172 search results - page 175 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
LICS
2009
IEEE
16 years 1 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson
CONCUR
2009
Springer
16 years 1 months ago
Winning Regions of Pushdown Parity Games: A Saturation Method
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
Matthew Hague, C.-H. Luke Ong
DFG
2009
Springer
16 years 1 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
16 years 1 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
ICSOC
2009
Springer
16 years 1 months ago
Gelee: Cooperative Lifecycle Management for (Composite) Artifacts
In this demonstration we introduce Gelee, our online platform for the hosted specification and cooperative execution of lifecycles of artifacts of any kind. With Gelee we aim at fi...
Marcos Báez, Cristhian Parra, Fabio Casati,...