1263 search results - page 80 / 253 » A* with Bounded Costs |
166
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
165
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
156
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
The paper considers making inferences about the underlying true 2-D motion when only evaluations of a local block-based cost function, the mean of absolute or squared differences,...
136
click to vote
CPAIOR
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
168
click to vote
AAIM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we study the computational problem of arbitrage in a frictional market with a finite number of bonds and finite and discrete times to maturity. Types of f...