Sciweavers

438 search results - page 23 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
SPAA
2003
ACM
14 years 1 months ago
Cycle stealing under immediate dispatch task assignment
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...
Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, ...
AAAI
2000
13 years 9 months ago
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
We describe MarketSAT, a highly decentralized, marketbased algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a ...
William E. Walsh, Michael P. Wellman
CEC
2009
IEEE
13 years 11 months ago
A conflict based SAW method for Constraint Satisfaction Problems
Evolutionary algorithms have employed the SAW (Stepwise Adaptation of Weights) method in order to solve CSPs (Constraint Satisfaction Problems). This method originated in hill-clim...
Rafi Shalom, Mireille Avigal, Ron Unger
HM
2007
Springer
114views Optimization» more  HM 2007»
13 years 11 months ago
Hybrid Numerical Optimization for Combinatorial Network Problems
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
Markus Chimani, Maria Kandyba, Mike Preuss
ANCS
2007
ACM
13 years 11 months ago
On LID assignment in infiniBand networks
To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID) in the InfiniBand specification, must be assigned to the destination and used in the forwar...
Wickus Nienaber, Xin Yuan, Zhenhai Duan