Sciweavers

1884 search results - page 144 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
15 years 3 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
124
Voted
HEURISTICS
2008
170views more  HEURISTICS 2008»
15 years 2 months ago
Accelerating autonomous learning by using heuristic selection of actions
This paper investigates how to make improved action selection for online policy learning in robotic scenarios using reinforcement learning (RL) algorithms. Since finding control po...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...
105
Voted
SPAA
2006
ACM
15 years 8 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
SSS
2007
Springer
15 years 8 months ago
Self-stabilization and Virtual Node Layer Emulations
We present formal definitions of stabilization for the Timed I/O Automata (TIOA) framework, and of emulation for the timed Virtual Stationary Automata programming abstraction laye...
Tina Nolte, Nancy A. Lynch
AI
2008
Springer
15 years 2 months ago
Theoretical analysis of singleton arc consistency and its extensions
Singleton arc consistency (SAC) is a consistency property that is simple to specify and is stronger than arc consistency. Algorithms have already been proposed to enforce SAC, but...
Christian Bessiere, Romuald Debruyne