10608 search results - page 529 / 2122 » Complexity of O'Hara's Algorithm |
155
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
147
click to vote
PPSN
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
156
Voted
WSC
2001
15 years 7 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
159
click to vote
DC
2007
15 years 6 months ago
2007
We present an adaptive algorithm for N-process mutual exclusion under read/write atomicity in which all busy waiting is by local spinning. In our algorithm, each process p perform...
200
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...