Sciweavers

381 search results - page 16 / 77
» Time Complexity of genetic algorithms on exponentially scale...
Sort
View
ICGA
1993
145views Optimization» more  ICGA 1993»
13 years 9 months ago
Genetic Programming of Minimal Neural Nets Using Occam's Razor
A genetic programming method is investigated for optimizing both the architecture and the connection weights of multilayer feedforward neural networks. The genotype of each networ...
Byoung-Tak Zhang, Heinz Mühlenbein
ASP
2005
Springer
14 years 1 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
RTAS
2003
IEEE
14 years 28 days ago
An Integrated Approach for Applying Dynamic Voltage Scaling to Hard Real-Time Systems
Wireless and portable devices depend on the limited power supplied by the battery. Dynamic Voltage Scaling (DVS) is an effective method to reduce CPU power consumption. For real-t...
Yanbin Liu, Aloysius K. Mok
BMCBI
2010
84views more  BMCBI 2010»
13 years 7 months ago
A variational Bayes algorithm for fast and accurate multiple locus genome-wide association analysis
Background: The success achieved by genome-wide association (GWA) studies in the identification of candidate loci for complex diseases has been accompanied by an inability to expl...
Benjamin A. Logsdon, Gabriel E. Hoffman, Jason G. ...
CVPR
2007
IEEE
14 years 9 months ago
Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
Carl Olsson, Anders P. Eriksson, Fredrik Kahl