Sciweavers

838 search results - page 7 / 168
» Finding Optimal Solutions to Atomix
Sort
View
EMNLP
2008
13 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
IEAAIE
1994
Springer
13 years 10 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
JC
2008
96views more  JC 2008»
13 years 6 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
IPCO
2001
125views Optimization» more  IPCO 2001»
13 years 8 months ago
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
Abstract. We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2n - 1 variables. The op...
Jean B. Lasserre
SIAMCO
2008
121views more  SIAMCO 2008»
13 years 6 months ago
A Direct Solution Method for Stochastic Impulse Control Problems of One-dimensional Diffusions
We consider stochastic impulse control problems where the process is driven by one-dimensional diffusions. Impulse control problems are widely applied to financial engineering and...
Masahiko Egami