Sciweavers

474 search results - page 80 / 95
» On Multicast Path Finding Algorithms
Sort
View
AAAI
2000
13 years 9 months ago
Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
Kate Larson, Tuomas Sandholm
ITCC
2005
IEEE
14 years 1 months ago
Zonal Rumor Routing for Wireless Sensor Networks
has to be relayed to nodes interested in those events. Moreover, nodes may also generate queries to find events they are interested in. Thus there is a need to route the informatio...
Tarun Banka, Gagan Tandon, Anura P. Jayasumana
ALGOSENSORS
2008
Springer
13 years 9 months ago
Simple Robots in Polygonal Environments: A Hierarchy
With the current progress in robot technology and related areas, sophisticated moving and sensing capabilities are at hand to design robots capable of solving seemingly complex tas...
Jan Brunner, Matús Mihalák, Subhash ...
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 7 months ago
Network Inference from Co-Occurrences
The study of networked systems is an emerging field, impacting almost every area of engineering and science, including the important domains of communication systems, biology, soc...
Michael Rabbat, Mário A. T. Figueiredo, Rob...
ICC
2009
IEEE
101views Communications» more  ICC 2009»
13 years 5 months ago
Using Limited Feedback in Power Allocation Design for a Two-Hop Relay OFDM System
In this paper, we study power allocation (PA) in a single-relay OFDM system with limited feedback. We propose a PA scheme that uses a codebook of quantized PA vectors designed offl...
Mahdi Hajiaghayi, Min Dong, Ben Liang