Sciweavers

1884 search results - page 41 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
NIPS
2003
14 years 11 months ago
All learning is Local: Multi-agent Learning in Global Reward Games
In large multiagent games, partial observability, coordination, and credit assignment persistently plague attempts to design good learning algorithms. We provide a simple and ef...
Yu-Han Chang, Tracey Ho, Leslie Pack Kaelbling
CORR
2011
Springer
136views Education» more  CORR 2011»
14 years 5 months ago
Degree Fluctuations and the Convergence Time of Consensus Algorithms
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...
Alexander Olshevsky, John N. Tsitsiklis
CPM
2004
Springer
108views Combinatorics» more  CPM 2004»
15 years 3 months ago
Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences
A popular approach in comparative genomics is to locate groups or clusters of orthologous genes in multiple genomes and to postulate functional association between the genes contai...
Thomas Schmidt, Jens Stoye
NETCOOP
2009
Springer
15 years 4 months ago
Understanding and Preventing Tacit Collusion among Telecommunication Operators
Abstract. Modeling the competition among telecommunication operators (or providers) as a repeated game may explain why tacit collusion to maintain high charging prices can be obser...
Patrick Maillé, Maurizio Naldi, Bruno Tuffi...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 3 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan