Sciweavers

14386 search results - page 302 / 2878
» The Chinese Generals Problem
Sort
View
170
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 20 hour ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 11 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
159
Voted
TAMC
2009
Springer
15 years 11 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 11 months ago
On solving hierarchical problems with top down control
We review recent work on the Hierarchical-If-And-Only-If problem and present a new hierarchical problem, HIFF-M that does not fit with previous explanations for evolutionary diffi...
Susan Khor
154
Voted
ATAL
2005
Springer
15 years 10 months ago
A distributed framework for solving the Multiagent Plan Coordination Problem
We examine whether and how the Multiagent Plan Coordination Problem, the problem of resolving interactions between the plans of multiple agents, can be cast as a Distributed Const...
Jeffrey S. Cox, Edmund H. Durfee, Thomas Bartold