Sciweavers

660 search results - page 128 / 132
» Hybrid CSP Solving
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
CEC
2007
IEEE
14 years 4 months ago
Concerning the potential of evolutionary support vector machines
— Within the present paper, we put forward a novel hybridization between support vector machines and evolutionary algorithms. Evolutionary support vector machines consider the cl...
Ruxandra Stoean, Mike Preuss, Catalin Stoean, Dumi...
ICC
2007
IEEE
165views Communications» more  ICC 2007»
14 years 4 months ago
Oblivious Keyword Search Protocols in the Public Database Model
— Databases associated with keywords, can be public, private or hybrid, as a result the solutions to keyword search protocols for each type are different. In this paper, we study...
Huafei Zhu, Feng Bao
GECCO
2007
Springer
235views Optimization» more  GECCO 2007»
14 years 4 months ago
Expensive optimization, uncertain environment: an EA-based solution
Real life optimization problems often require finding optimal solution to complex high dimensional, multimodal problems involving computationally very expensive fitness function e...
Maumita Bhattacharya
ISCAS
2006
IEEE
145views Hardware» more  ISCAS 2006»
14 years 3 months ago
The wordlength determination problem of linear time invariant systems with multiple outputs - a geometric programming approach
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
S. C. Chan, K. M. Tsui