3433 search results - page 619 / 687 » Heuristics for a bidding problem |
104
click to vote
TCAD
2008
14 years 11 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
106
click to vote
TPDS
2008
14 years 11 months ago
2008
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
106
click to vote
ANOR
2002
14 years 11 months ago
2002
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model inco...
CN
2004
14 years 11 months ago
2004
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
118
click to vote
ALGORITHMICA
2000
14 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...