77 search results - page 13 / 16 » Timing optimization by restructuring long combinatorial path... |
141
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
127
Voted
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
109
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
166
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
102
Voted
IROS
2007
IEEE
15 years 9 months ago
2007
IEEE
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...