Sciweavers

467 search results - page 81 / 94
» Learning of Agents with Limited Resources
Sort
View
IAT
2009
IEEE
14 years 2 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
ENVSOFT
2007
76views more  ENVSOFT 2007»
13 years 7 months ago
Biocomplexity of deforestation in the Caparo tropical forest reserve in Venezuela: An integrated multi-agent and cellular automa
A multi-agent model of social and environmental complexity of deforestation was developed for the Caparo Forest Reserve, Venezuela. It includes three types of agents: settlers, go...
Niandry Moreno, Raquel Quintero, Magdiel Ablan, Ro...
SOFSEM
2010
Springer
14 years 4 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
ICRA
2008
IEEE
149views Robotics» more  ICRA 2008»
14 years 2 months ago
Information-optimal selective data return for autonomous rover traverse science and survey
— Selective data return leverages onboard data analysis to allocate limited bandwidth resources during remote exploration. Here we present an adaptive method to subsample image s...
David R. Thompson, Trey Smith, David Wettergreen
INFOCOM
2007
IEEE
14 years 2 months ago
Malicious Users in Unstructured Networks
—Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow ...
George Theodorakopoulos, John S. Baras