Sciweavers

835 search results - page 160 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ECCC
2000
158views more  ECCC 2000»
13 years 7 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
ML
2007
ACM
104views Machine Learning» more  ML 2007»
13 years 7 months ago
A general criterion and an algorithmic framework for learning in multi-agent systems
We offer a new formal criterion for agent-centric learning in multi-agent systems, that is, learning that maximizes one’s rewards in the presence of other agents who might also...
Rob Powers, Yoav Shoham, Thuc Vu
PUC
2008
174views more  PUC 2008»
13 years 7 months ago
A wireless sensor networks MAC protocol for real-time applications
Abstract Wireless sensor networks (WSN) are designed for data gathering and processing, with particular requirements: low hardware complexity, low energy consumption, special traff...
Esteban Egea-López, Javier Vales-Alonso, Al...
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
13 years 6 months ago
Maintaining connectivity in environments with obstacles
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
Onur Tekdas, Patrick A. Plonski, Nikhil Karnad, Vo...
PODC
2010
ACM
13 years 6 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...