Sciweavers

2925 search results - page 67 / 585
» Information Complexity of Online Problems
Sort
View
COMAD
2008
15 years 7 months ago
Information Integration Across Heterogeneous Sources: Where Do We Stand and How to Proceed?
Today, information integration has assumed a completely different, complex connotation than what it used to be. The advent of the Internet, the proliferation of information source...
Aditya Telang, Sharma Chakravarthy, Yan Huang
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
16 years 3 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
INFOCOM
2007
IEEE
16 years 11 days ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
CDC
2008
IEEE
166views Control Systems» more  CDC 2008»
15 years 8 months ago
Distributed coverage verification in sensor networks without location information
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
Alireza Tahbaz-Salehi, Ali Jadbabaie
IROS
2007
IEEE
188views Robotics» more  IROS 2007»
16 years 10 days ago
Behavior maps for online planning of obstacle negotiation and climbing on rough terrain
Abstract— To autonomously navigate on rough terrain is a challenging problem for mobile robots, requiring the ability to decide whether parts of the environment can be traversed ...
Christian Dornhege, Alexander Kleiner