3678 search results - page 414 / 736 » On the Stable Paths Problem |
194
click to vote
GD
1997
Springer
15 years 11 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...
170
click to vote
DAC
1989
ACM
15 years 10 months ago
1989
ACM
We present a new 0 (n2) heuristic for hypergraph min-cut bipartitioning, an important problem in circuit placement. Fastest previous methods for this problem are O(n2 log n). Our ...
189
click to vote
CAAN
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...
150
click to vote
ISER
2000
Springer
15 years 10 months ago
2000
Springer
: A solution to the singularity problem is presented from the approach of the operational space formulation which involves both motion and force control. A brief summary of the Ope...
155
click to vote
FLAIRS
2007
15 years 9 months ago
2007
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...