Sciweavers

241 search results - page 20 / 49
» Path optimization for multiple objectives in directed graphs...
Sort
View
TON
2010
158views more  TON 2010»
13 years 6 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
GECCO
1999
Springer
167views Optimization» more  GECCO 1999»
14 years 2 days ago
A Biologically Inspired Fitness Function for Robotic Grasping
This paper describes the innovative use of genetic programming (GP) to solve the grasp synthesis problem for multifingered robot hands. The goal of our algorithm is to select a Ò...
J. Jaime Fernandez, Ian D. Walker
NAACL
2007
13 years 9 months ago
Randomized Decoding for Selection-and-Ordering Problems
The task of selecting and ordering information appears in multiple contexts in text generation and summarization. For instance, methods for title generation construct a headline b...
Pawan Deshpande, Regina Barzilay, David R. Karger
IPPS
2006
IEEE
14 years 1 months ago
Parallelizing post-placement timing optimization
This paper presents an efficient modeling scheme and a partitioning heuristic for parallelizing VLSI post-placement timing optimization. Encoding the paths with timing violations...
Jiyoun Kim, Marios C. Papaefthymiou, José N...
NHM
2010
87views more  NHM 2010»
13 years 2 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...