Sciweavers

1068 search results - page 86 / 214
» On Space Bounded Server Algorithms
Sort
View
NIPS
2008
13 years 9 months ago
Regularized Policy Iteration
In this paper we consider approximate policy-iteration-based reinforcement learning algorithms. In order to implement a flexible function approximation scheme we propose the use o...
Amir Massoud Farahmand, Mohammad Ghavamzadeh, Csab...
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 8 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
13 years 11 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 12 days ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...