Sciweavers

457 search results - page 69 / 92
» Upper and Lower Bounds on Continuous-Time Computation
Sort
View
CPAIOR
2006
Springer
13 years 11 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»
13 years 8 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
13 years 7 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
13 years 5 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
ICALP
2009
Springer
14 years 7 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor