Sciweavers

315 search results - page 48 / 63
» Are Multiple Runs of Genetic Algorithms Better than One
Sort
View
QSHINE
2005
IEEE
14 years 4 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
BMCBI
2011
13 years 2 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ISQED
2005
IEEE
78views Hardware» more  ISQED 2005»
14 years 4 months ago
Staggered Twisted-Bundle Interconnect for Crosstalk and Delay Reduction
Abstract— To achieve small delay and low crosstalk for multiple signal nets with capacitive and inductive coupling, we propose in this paper a novel interconnect structure, stagg...
Hao Yu, Lei He
SIGSOFT
2005
ACM
14 years 11 months ago
Applying classification techniques to remotely-collected program execution data
There is an increasing interest in techniques that support measurement and analysis of fielded software systems. One of the main goals of these techniques is to better understand ...
Murali Haran, Alan F. Karr, Alessandro Orso, Adam ...
GECCO
2004
Springer
14 years 4 months ago
Improving Generalisation Performance Through Multiobjective Parsimony Enforcement
This paper describes POPE-GP, a system that makes use of the NSGA-II multiobjective evolutionary algorithm as an alternative, parameter-free technique for eliminating program bloat...
Yaniv Bernstein, Xiaodong Li, Victor Ciesielski, A...