Sciweavers

1171 search results - page 46 / 235
» Variable neighborhood search
Sort
View
55
Voted
IJON
2006
84views more  IJON 2006»
14 years 9 months ago
Cycle-to-cycle variability as an optimal behavioral strategy
Aplysia feeding behavior is highly variable from cycle to cycle. In some cycles, when the variability causes a mismatch between the animal's movements and the requirements of...
Vladimir Brezina, Alex Proekt, Klaudiusz R. Weiss
IWPC
1998
IEEE
15 years 1 months ago
Archetypal Source Code Searches: A Survey of Software Developers and Maintainers
In this study, we conducted a survey to generate archetypes of source code searching by programmers across maintenance tasks. Using a questionnaire on a web page, we obtained 69 r...
Susan Elliott Sim, Charles L. A. Clarke, Richard C...
VLSID
2003
IEEE
126views VLSI» more  VLSID 2003»
15 years 10 months ago
Comparison of Heuristic Algorithms for Variable Partitioning in Circuit Implementation
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...
Muthukumar Venkatesan, Henry Selvaraj
MSV
2004
14 years 11 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
IJON
2007
134views more  IJON 2007»
14 years 9 months ago
Analysis of SVM regression bounds for variable ranking
This paper addresses the problem of variable ranking for Support Vector Regression. The relevance criteria that we proposed are based on leave-one-out bounds and some variants and...
Alain Rakotomamonjy