518 search results - page 60 / 104 » Beating a Random Assignment |
151
click to vote
TEC
2002
15 years 2 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
116
Voted
PE
2010
Springer
15 years 29 days ago
2010
Springer
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
127
click to vote
COLT
2010
Springer
15 years 17 days ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
131
click to vote
COMSIS
2010
14 years 12 months ago
2010
According to the different requests of Web and the heterogeneity of Web server, the paper presents a content-based loadbalancing algorithm. The mechanism of this algorithm is that ...
111
Voted
TRANSCI
2010
14 years 9 months ago
2010
We study an integrated supply chain design problem that determines the locations of retailers and the assignments of customers to retailers in order to minimize the expected costs...