Sciweavers

614 search results - page 86 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
CPAIOR
2006
Springer
15 years 1 months ago
The Power of Semidefinite Programming Relaxations for MAX-SAT
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 ...
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
14 years 11 months ago
Runtime analysis of binary PSO
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...
Dirk Sudholt, Carsten Witt
TCS
2008
14 years 9 months ago
Bincoloring
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...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
INFOCOM
2010
IEEE
14 years 8 months ago
Capacity Region of a Wireless Mesh Backhaul Network over the CSMA/CA MAC
—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...
Yu Cheng, Hongkun Li, Peng-Jun Wan, Xinbing Wang
CORR
2008
Springer
76views Education» more  CORR 2008»
14 years 10 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
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...
Navin Kashyap