Sciweavers

952 search results - page 86 / 191
» Computational complexity of stochastic programming problems
Sort
View
PVM
1997
Springer
15 years 4 months ago
Message-Passing Program Development by Ensemble
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
John Yiannis Cotronis
91
Voted
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 6 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
126
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 8 days ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
FLOPS
2004
Springer
15 years 6 months ago
A Brief Survey of Quantum Programming Languages
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
Peter Selinger
122
Voted
BMCBI
2007
161views more  BMCBI 2007»
15 years 22 days ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo