Sciweavers

1984 search results - page 173 / 397
» The colourful feasibility problem
Sort
View
AAAI
2006
15 years 8 months ago
Weighted Constraint Satisfaction with Set Variables
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...
J. H. M. Lee, C. F. K. Siu
ML
2000
ACM
103views Machine Learning» more  ML 2000»
15 years 6 months ago
Phase Transitions in Relational Learning
One of the major limitations of relational learning is due to the complexity of verifying hypotheses on examples. In this paper we investigate this task in light of recent publishe...
Attilio Giordana, Lorenza Saitta
SIGMETRICS
2002
ACM
142views Hardware» more  SIGMETRICS 2002»
15 years 6 months ago
Probabilistic scalable P2P resource location services
Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory ...
Daniel A. Menascé, Lavanya Kanchanapalli
AIPS
2004
15 years 8 months ago
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
Dmitri A. Dolgov, Edmund H. Durfee
MOR
2002
94views more  MOR 2002»
15 years 6 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel