983 search results - page 106 / 197 » Negative-Weight Cycle Algorithms |
113
Voted
ICCV
2007
IEEE
15 years 7 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
78
Voted
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper deals with optimizing the task cycle time of industrial robots integrated in complex robot cells. Trajectory optimizers are usually based on models and can’t properly...
94
Voted
ICN
2005
Springer
15 years 6 months ago
2005
Springer
A strategy for energy saving in wireless sensor networks is to manage the duty cycle of sensors, by dynamically selecting a different set of nodes to be active in every moment. We ...
103
Voted
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
102
Voted
EUROMICRO
2002
IEEE
15 years 5 months ago
2002
IEEE
The Mobile Multimedia Modem (M3)-DSP is based on a scalable, highly parallel DSP platform concept capable of delivering the processing power to create software solutions for tasks...