2694 search results - page 400 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
134
click to vote
EVOW
2010
Springer
16 years 1 months ago
2010
Springer
We describe and evaluate a multi-objective optimisation (MOO) algorithm that works within the Probability Collectives (PC) optimisation framework. PC is an alternative approach to ...
207
click to vote
GLOBECOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
176
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
153
click to vote
ARCS
2006
Springer
15 years 10 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
164
click to vote
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
To enable services such as streaming multimedia and voice in multi-hop wireless networks it is necessary to develop algorithms that guarantee Quality of Service (QoS). In this pape...