Sciweavers

350 search results - page 30 / 70
» Lower bounds and heuristic algorithms for the k
Sort
View
75
Voted
BROADNETS
2005
IEEE
15 years 3 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
72
Voted
ICALP
2005
Springer
15 years 3 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
JAIR
2008
130views more  JAIR 2008»
14 years 9 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
MASS
2010
14 years 7 months ago
You can't get there from here: Sensor scheduling with refocusing delays
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
Yosef Alayev, Amotz Bar-Noy, Matthew P. Johnson, L...
104
Voted
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
14 years 4 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus