838 search results - page 93 / 168 » Finding Optimal Solutions to Atomix |
102
click to vote
SIROCCO
2001
15 years 1 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
111
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
112
click to vote
SIROCCO
2004
15 years 1 months ago
2004
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a...
AAAI
2000
15 years 1 months ago
2000
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
111
click to vote
UAI
2000
15 years 1 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...