Sciweavers

7280 search results - page 1396 / 1456
» Optimization Techniques
Sort
View
FPGA
2007
ACM
163views FPGA» more  FPGA 2007»
15 years 5 months ago
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs
Boolean matching (BM) is a widely used technique in FPGA resynthesis and architecture evaluation. In this paper we present several improvements to the recently proposed SAT-based ...
Jason Cong, Kirill Minkovich
GECCO
2007
Springer
194views Optimization» more  GECCO 2007»
15 years 5 months ago
Hybrid coevolutionary algorithms vs. SVM algorithms
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
Rui Li, Bir Bhanu, Krzysztof Krawiec
GECCO
2007
Springer
138views Optimization» more  GECCO 2007»
15 years 5 months ago
Unwitting distributed genetic programming via asynchronous JavaScript and XML
The success of a genetic programming system in solving a problem is often a function of the available computational resources. For many problems, the larger the population size an...
Jon Klein, Lee Spector
GECCO
2007
Springer
212views Optimization» more  GECCO 2007»
15 years 5 months ago
A developmental model of neural computation using cartesian genetic programming
The brain has long been seen as a powerful analogy from which novel computational techniques could be devised. However, most artificial neural network approaches have ignored the...
Gul Muhammad Khan, Julian F. Miller, David M. Hall...
IPSN
2007
Springer
15 years 5 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
« Prev « First page 1396 / 1456 Last » Next »