Sciweavers

619 search results - page 45 / 124
» A dynamical systems approach to weighted graph matching
Sort
View
ESOP
2006
Springer
13 years 11 months ago
Path Optimization in Programs and Its Application to Debugging
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
Akash Lal, Junghee Lim, Marina Polishchuk, Ben Lib...
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 1 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
CP
2003
Springer
14 years 27 days ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
ICC
2007
IEEE
14 years 2 months ago
Utility Maximization for OFDMA Systems Over Discrete Sets
— The main task in OFDM downlink scheduling design is to maximize some kind of utility considering user specific as well as system induced constraints. A typical example is the ...
Chan Zhou, Gerhard Wunder, Thomas Michel
ICRA
2008
IEEE
194views Robotics» more  ICRA 2008»
14 years 2 months ago
A new variable stiffness design: Matching requirements of the next robot generation
— Facing new tasks, the conventional rigid design of robotic joints has come to its limits. Operating in unknown environments current robots are prone to failure when hitting unf...
Sebastian Wolf, Gerd Hirzinger