Sciweavers

2924 search results - page 113 / 585
» Lower Bounds in Distributed Computing
Sort
View
CP
2011
Springer
14 years 13 days ago
Pseudo-Tree-Based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Mako...
WG
1999
Springer
15 years 4 months ago
Linear Orderings of Random Geometric Graphs
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
Josep Díaz, Mathew D. Penrose, Jordi Petit,...
91
Voted
EUC
2006
Springer
15 years 4 months ago
On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances
We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activiti...
Hyeonjoong Cho, Haisang Wu, Binoy Ravindran, E. Do...
104
Voted
CISS
2008
IEEE
15 years 7 months ago
Cramer Rao bound on target localization estimation in MIMO radar systems
Abstract— This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (MultipleInput Multiple-Output) radar systems, configured with multiple ...
Hana Godrich, Alexander M. Haimovich, Rick S. Blum
ICAART
2010
INSTICC
15 years 9 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis