982 search results - page 124 / 197 » Solving Steiner tree problems in graphs to optimality |
108
click to vote
SPAA
1990
ACM
15 years 4 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...
91
Voted
FPL
2000
Springer
15 years 4 months ago
2000
Springer
This paper describes a novel resource binding technique for use in multiple-wordlength systems implemented in FPGAs. It is demonstrated that the multiple-wordlength binding problem...
150
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
86
Voted
TROB
2008
15 years 15 days ago
2008
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
123
click to vote
DATE
2004
IEEE
15 years 4 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...