2434 search results - page 215 / 487 » Algorithmic Randomness of Closed Sets |
139
click to vote
EOR
2007
15 years 4 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
146
click to vote
ATAL
2011
Springer
14 years 4 months ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...
179
click to vote
AI
2005
Springer
15 years 4 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
134
click to vote
PE
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
133
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...