Sciweavers

641 search results - page 102 / 129
» Improved Bounds for Wireless Localization
Sort
View
JAIR
2008
130views more  JAIR 2008»
13 years 7 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...
PODC
2011
ACM
12 years 10 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
HPDC
2005
IEEE
14 years 1 months ago
GWiQ-P: an efficient decentralized grid-wide quota enforcement protocol
Mega grids span several continents and may consist of millions of nodes and billions of tasks executing at any point in time. This setup calls for scalable and highly available re...
Kfir Karmon, Liran Liss, Assaf Schuster
TSP
2008
115views more  TSP 2008»
13 years 7 months ago
Sinusoidal Modeling and Adaptive Channel Prediction in Mobile OFDM Systems
We propose a wireless fading channel prediction algorithm for a pilot-symbol aided Orthogonal Frequency Division Multiplexing (OFDM) system. Assuming a doubly selective (time and ...
Ian C. Wong, Brian L. Evans
ESA
2009
Springer
107views Algorithms» more  ESA 2009»
14 years 2 months ago
Disproof of the Neighborhood Conjecture with Implications to SAT
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
Heidi Gebauer