614 search results - page 86 / 123 » Local Computation: Lower and Upper Bounds |
166
click to vote
CPAIOR
2006
Springer
15 years 9 months ago
2006
Springer
Recently, Linear Programming (LP)-based relaxations have been shown promising in boosting the performance of exact MAX-SAT solvers. We compare Semidefinite Programming (SDP) based ...
165
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
159
click to vote
TCS
2008
15 years 6 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
166
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—This paper studies the maximum throughput that can be supported by a given wireless mesh backhaul network, over a practical CSMA/CA medium access control (MAC) protocol. We reso...
130
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...