Sciweavers

44 search results - page 7 / 9
» Numerical methods for shape-from-shading: A new survey with ...
Sort
View
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
FMCAD
2009
Springer
14 years 1 months ago
Decision diagrams for linear arithmetic
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
Sagar Chaki, Arie Gurfinkel, Ofer Strichman
VMCAI
2009
Springer
14 years 2 months ago
Finding Concurrency-Related Bugs Using Random Isolation
This paper describes the methods used in Empire, a tool to detect concurrency-related bugs, namely atomic-set serializability violations in Java programs. The correctness criterion...
Nicholas Kidd, Thomas W. Reps, Julian Dolby, Manda...
CGO
2003
IEEE
14 years 20 days ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
TEC
2008
100views more  TEC 2008»
13 years 7 months ago
Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization
Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is...
Ernesto Mininno, Francesco Cupertino, David Naso