Sciweavers

3690 search results - page 584 / 738
» Computation with classical sequents
Sort
View
DAGM
2009
Springer
15 years 6 months ago
A Gradient Descent Approximation for Graph Cuts
Abstract. Graph cuts have become very popular in many areas of computer vision including segmentation, energy minimization, and 3D reconstruction. Their ability to find optimal res...
Alparslan Yildiz, Yusuf Sinan Akgul
FSTTCS
2008
Springer
15 years 6 months ago
Graph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
Julien Cristau, Florian Horn
GECCO
2008
Springer
124views Optimization» more  GECCO 2008»
15 years 6 months ago
Introducing MONEDA: scalable multiobjective optimization with a neural estimation of distribution algorithm
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
Luis Martí, Jesús García, Ant...
126
Voted
SMA
2010
ACM
177views Solid Modeling» more  SMA 2010»
15 years 5 months ago
Multi-level grid algorithms for faster molecular energetics
Bio-molecules reach their stable configuration in solvent which is primarily water with a small concentration of salt ions. One approximation of the total free energy of a bio-mol...
Rezaul Alam Chowdhury, Chandrajit L. Bajaj
178
Voted
CEC
2008
IEEE
15 years 5 months ago
Regulation of gene regulation - smooth binding with dynamic affinity affects evolvability
Abstract-- Understanding the evolvability of simple differentiating multicellular systems is a fundamental problem in the biology of genetic regulatory networks and in computationa...
Johannes F. Knabe, Chrystopher L. Nehaniv, Maria J...