Sciweavers

8768 search results - page 395 / 1754
» Generalizing the notion of support
Sort
View
CP
2001
Springer
16 years 6 days ago
A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, ...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
ICALP
1994
Springer
15 years 11 months ago
Liveness in Timed and Untimed Systems
When provingthe correctness of algorithmsin distributed systems, one generally considers safety conditions and liveness conditions. The Input Output I O automaton model and its ti...
Rainer Gawlick, Roberto Segala, Jørgen F. S...
ESCIENCE
2006
IEEE
15 years 11 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
NIPS
2008
15 years 9 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
IPCO
1996
121views Optimization» more  IPCO 1996»
15 years 9 months ago
Transitive Packing
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
Rudolf Müller, Andreas S. Schulz