Sciweavers

1059 search results - page 130 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
CLUSTER
2002
IEEE
13 years 8 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
ALMOB
2007
151views more  ALMOB 2007»
13 years 9 months ago
Local sequence alignments statistics: deviations from Gumbel statistics in the rare-event tail
Background: The optimal score for ungapped local alignments of infinitely long random sequences is known to follow a Gumbel extreme value distribution. Less is known about the imp...
Stefan Wolfsheimer, Bernd Burghardt, Alexander K. ...
JMLR
2010
148views more  JMLR 2010»
13 years 3 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
ISPD
2003
ACM
121views Hardware» more  ISPD 2003»
14 years 2 months ago
Optimality, scalability and stability study of partitioning and placement algorithms
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
Jason Cong, Michail Romesis, Min Xie
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer