Sciweavers

417 search results - page 79 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
JMLR
2010
149views more  JMLR 2010»
13 years 3 months ago
Learning Bayesian Network Structure using LP Relaxations
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
Tommi Jaakkola, David Sontag, Amir Globerson, Mari...
JPDC
2008
138views more  JPDC 2008»
13 years 8 months ago
Efficient parallel implementation of iterative reconstruction algorithms for electron tomography
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the threedimensional structure of complex biological specim...
José-Jesús Fernández, Dan Gor...
BMCBI
2006
127views more  BMCBI 2006»
13 years 8 months ago
On the attenuation and amplification of molecular noise in genetic regulatory networks
Background: Noise has many important roles in cellular genetic regulatory functions at the nanomolar scale. At present, no good theory exists for identifying all possible mechanis...
Bor-Sen Chen, Yu-Chao Wang
FLAIRS
1998
13 years 10 months ago
An AI Approach to Computer Assisted Tomography
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
John F. Kolen, David A. Shamma, Thomas Reichherzer...