Sciweavers

1177 search results - page 144 / 236
» System-in-Package Testing: Problems and Solutions
Sort
View
ALMOB
2006
138views more  ALMOB 2006»
14 years 10 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
AMAI
1999
Springer
14 years 9 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
ICIP
2003
IEEE
15 years 11 months ago
A Bayesian framework for Gaussian mixture background modeling
Background subtraction is an essential processing component for many video applications. However, its development has largely been application driven and done in ad hoc manners. I...
Dar-Shyang Lee, Jonathan J. Hull, Berna Erol
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 4 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ACMSE
2006
ACM
15 years 4 months ago
A SAT-based solver for Q-ALL SAT
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
Ben Browning, Anja Remshagen