Sciweavers

4565 search results - page 348 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
157
Voted
GECCO
2003
Springer
15 years 10 months ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
AIPS
2010
15 years 7 months ago
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
Hootan Nakhost, Martin Müller 0003
NIPS
1998
15 years 6 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
166
Voted
ALGORITHMICA
2007
132views more  ALGORITHMICA 2007»
15 years 5 months ago
On the Feasibility of Time Estimation under Isolation Conditions in Wireless Sensor Networks
We study the problem of providing a sensor with an accurate estimate of the time, from a novel perspective which is complementary to the well-studied clock synchronization problem....
Daniela Tulone
DIALM
2003
ACM
113views Algorithms» more  DIALM 2003»
15 years 10 months ago
Multicast time maximization in energy constrained wireless networks
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
Patrik Floréen, Petteri Kaski, Jukka Kohone...