1171 search results - page 92 / 235 » Variable neighborhood search |
TCAD
2002
14 years 9 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
IEAAIE
2010
Springer
14 years 7 months ago
2010
Springer
This work deals with an original problem with regard to the traditionally sequential planning process in public transit networks. This problem aims at modifying the network's ...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The scene flow in binocular stereo setup is estimated using a seed growing algorithm. A pair of calibrated and synchronized cameras observe a scene and output a sequence of image...
144
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
We present an efficient algorithm for continuous image
recognition and feature descriptor tracking in video which
operates by reducing the search space of possible interest
poin...
109
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...