Sciweavers

489 search results - page 78 / 98
» Towards an Analysis of Local Optimization Algorithms
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
ICASSP
2008
IEEE
14 years 2 months ago
Image processing by topological asymptotic analysis
The aim of this article is to recall the applications of the topological asymptotic expansion to many image processing problems. We briefly review the topological asymptotic analy...
Didier Auroux, Mohamed Masmoudi
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
14 years 2 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
SIGIR
2006
ACM
14 years 1 months ago
Feature diversity in cluster ensembles for robust document clustering
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
Xavier Sevillano, Germán Cobo, Francesc Al&...
IASTEDSEA
2004
13 years 9 months ago
Java bytecode verification with dynamic structures
Java applets run on a Virtual Machine that checks code's integrity and correctness before execution using a module called Bytecode Verifier. Java Card technology allows Java ...
Cinzia Bernardeschi, Luca Martini, Paolo Masci