3019 search results - page 92 / 604 » Approximating the Domatic Number |
COCOON
2006
Springer
15 years 3 months ago
2006
Springer
We consider the problem of placing a set of disks in a region containing obstacles such that no two disks intersect. We are given a bounding polygon P and a set R of possibly inte...
WSC
2008
15 years 2 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
116
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs...
119
click to vote
CP
2008
Springer
15 years 1 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
NIPS
2008
15 years 1 months ago
2008
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...