Sciweavers

2620 search results - page 49 / 524
» An Evaluation Technique for Binarization Algorithms
Sort
View
CAV
2006
Springer
141views Hardware» more  CAV 2006»
13 years 11 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
FLAIRS
2008
13 years 10 months ago
A Novel Prioritization Technique for Solving Markov Decision Processes
We address the problem of computing an optimal value function for Markov decision processes. Since finding this function quickly and accurately requires substantial computation ef...
Jilles Steeve Dibangoye, Brahim Chaib-draa, Abdel-...
GECCO
2008
Springer
201views Optimization» more  GECCO 2008»
13 years 9 months ago
Advanced techniques for the creation and propagation of modules in cartesian genetic programming
The choice of an appropriate hardware representation model is key to successful evolution of digital circuits. One of the most popular models is cartesian genetic programming, whi...
Paul Kaufmann, Marco Platzner
JEI
2007
176views more  JEI 2007»
13 years 7 months ago
Adaptive techniques for microarray image analysis with related quality assessment
We propose novel techniques for microarray image analysis. In particular, we describe an overall pipeline able to solve the most common problems of microarray image analysis. We pr...
Sebastiano Battiato, Gianpiero di Blasi, Giovanni ...
DAC
2009
ACM
14 years 8 months ago
Computing bounds for fault tolerance using formal techniques
Continuously shrinking feature sizes result in an increasing susceptibility of circuits to transient faults, e.g. due to environmental radiation. Approaches to implement fault tol...
André Sülflow, Görschwin Fey, Rol...