Sciweavers

16666 search results - page 3289 / 3334
» Descriptive and Computational Complexity
Sort
View
AI
2006
Springer
15 years 4 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
145
Voted
ALMOB
2006
113views more  ALMOB 2006»
15 years 4 months ago
Inverse bifurcation analysis: application to simple gene systems
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
James Lu, Heinz W. Engl, Peter Schuster
145
Voted
ENTCS
2008
146views more  ENTCS 2008»
15 years 4 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
AOR
2006
95views more  AOR 2006»
15 years 3 months ago
A New Practically Efficient Interior Point Method for LP
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In...
Katta G. Murty
EOR
2008
106views more  EOR 2008»
15 years 3 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
« Prev « First page 3289 / 3334 Last » Next »