Sciweavers

1963 search results - page 170 / 393
» The Maximum Solution Problem on Graphs
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 10 months ago
Bidirectional Search for Interactive Motion Synthesis
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
Wan-Yen Lo and Matthias Zwicker
BMCBI
2008
121views more  BMCBI 2008»
15 years 2 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
106
Voted
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 2 months ago
Approximating Transitivity in Directed Networks
We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
156
Voted
CDC
2010
IEEE
176views Control Systems» more  CDC 2010»
14 years 9 months ago
Optimal trajectories for multi robot localization
This paper considers the problem of multi robot localization. The analysis is focused on the problem of determining which are the optimal robot trajectories in order to minimize th...
Andrea Cristofaro, Agostino Martinelli
EOR
2006
57views more  EOR 2006»
15 years 2 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro