Sciweavers

1171 search results - page 70 / 235
» Variable neighborhood search
Sort
View
AAAI
1996
14 years 11 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
FPL
2008
Springer
113views Hardware» more  FPL 2008»
14 years 11 months ago
Mapping and scheduling with task clustering for heterogeneous computing systems
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
Yuet Ming Lam, José Gabriel F. Coutinho, Wa...
MVA
1996
129views Computer Vision» more  MVA 1996»
14 years 11 months ago
Computation of Optical Flow Using Dynamic Programming
This paper presents an original algorithm for the computation of optical ow called Orthogonal Dynamic Programming (ODP) as well as several enhancements to it. The principle is to ...
Georges Quénot
HM
2010
Springer
133views Optimization» more  HM 2010»
14 years 10 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 6 months ago
A Hybrid RTS-BP Algorithm for Improved Detection of Large-MIMO M-QAM Signals
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
Tanumay Datta, N. Srinidhi, Ananthanarayanan Chock...