Sciweavers

1529 search results - page 125 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CP
2003
Springer
15 years 9 months ago
Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
Abstract. Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to de...
Carlos Eisenberg, Boi Faltings
CSB
2003
IEEE
152views Bioinformatics» more  CSB 2003»
15 years 9 months ago
A Parallel Genetic Algorithm for Physical Mapping of Chromosomes
Physical map reconstruction in the presence of errors is a central problem in genetics of high computational complexity. A parallel genetic algorithm for a maximum likelihood esti...
Suchendra M. Bhandarkar, Jinling Huang, Jonathan A...
APPML
2007
75views more  APPML 2007»
15 years 4 months ago
Analysis of substructuring preconditioners for mortar methods in an abstract framework
framework Silvia Bertoluzza∗, Micol Pennacchio Istituto di Matematica Applicata e Tecnologie Informatiche del C.N.R., v. Ferrata 1, 27100 Pavia, Italy Received 16 February 2006; ...
Silvia Bertoluzza, Micol Pennacchio
INFORMATICALT
2007
43views more  INFORMATICALT 2007»
15 years 4 months ago
Functional Test Generation Based on Combined Random and Deterministic Search Methods
Abstract. The aim of this paper is to explore some features of the functional test generation problem, and on the basis of the gained experience, to propose a practical method for ...
Eduardas Bareisa, Vacius Jusas, Kestutis Motiejuna...
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
16 years 5 months ago
Similarity Search in Arbitrary Subspaces Under Lp-Norm
Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves...
Xiang Lian, Lei Chen 0002