Sciweavers

407 search results - page 72 / 82
» The Optimal Online Algorithms for Minimizing Maximum Latenes...
Sort
View
SIROCCO
2008
14 years 11 months ago
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
In the effort to understand the algorithmic limitations of computing by a swarm of robots, the research has focused on the minimal capabilities that allow a problem to be solved. ...
Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nic...
ECCV
2008
Springer
15 years 7 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
97
Voted
INFOCOM
1998
IEEE
15 years 1 months ago
Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with No Wavelength Changers
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
Rajesh M. Krishnaswamy, Kumar N. Sivarajan
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
14 years 6 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
TWC
2008
143views more  TWC 2008»
14 years 9 months ago
Power-efficient wireless OFDMA using limited-rate feedback
Emerging applications involving low-cost wireless sensor networks motivate well optimization of multi-user orthogonal frequency-division multiple access (OFDMA) in the power-limite...
Antonio G. Marqués, Georgios B. Giannakis, ...