Sciweavers

294 search results - page 51 / 59
» A hybrid metaheuristic approach to solving the UBQP problem
Sort
View
RECOMB
2002
Springer
14 years 7 months ago
String barcoding: uncovering optimal virus signatures
There are many critical situations when one needs to rapidly identify an unidentified pathogen from among a given set of previously sequenced pathogens. DNA or RNA hybridization c...
Sam Rash, Dan Gusfield
CANDC
2006
ACM
13 years 7 months ago
Dealing with repetitions in sequencing by hybridization
DNA sequencing by hybridization (SBH) induces errors in the biochemical experiment. Some of them are random and disappear when the experiment is repeated. Others are systematic, i...
Jacek Blazewicz, Fred Glover, Marta Kasprzak, Wojc...
KI
1999
Springer
13 years 11 months ago
Systematic vs. Local Search for SAT
Abstract. Due to its prominence in artificial intelligence and theoretical computer science, the propositional satisfiability problem (SAT) has received considerable attention in...
Holger H. Hoos, Thomas Stützle
ESWA
2006
114views more  ESWA 2006»
13 years 7 months ago
Bankruptcy prediction with neural logic networks by means of grammar-guided genetic programming
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
Athanasios Tsakonas, Georgios Dounias, Michael Dou...
CP
2009
Springer
14 years 2 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...