Sciweavers

90 search results - page 4 / 18
» A swarm based approximated algorithm to the extended general...
Sort
View
FSTTCS
2001
Springer
13 years 10 months ago
Semidefinite Programming Based Approximation Algorithms
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
Uri Zwick
MONET
2006
107views more  MONET 2006»
13 years 6 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao
CDC
2008
IEEE
14 years 22 days ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano
DCOSS
2008
Springer
13 years 8 months ago
Frugal Sensor Assignment
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
Matthew P. Johnson, Hosam Rowaihy, Diego Pizzocaro...
GECCO
2009
Springer
169views Optimization» more  GECCO 2009»
13 years 11 months ago
An ant based algorithm for task allocation in large-scale and dynamic multiagent scenarios
This paper addresses the problem of multiagent task allocation in extreme teams. An extreme team is composed by a large number of agents with overlapping functionality operating i...
Fernando dos Santos, Ana L. C. Bazzan