Sciweavers

1578 search results - page 130 / 316
» Algorithmic randomness of continuous functions
Sort
View
WSC
2000
15 years 3 months ago
A practical approach to sample-path simulation optimization
We propose solving continuous parametric simulation optimizations using a deterministic nonlinear optimization algorithm and sample-path simulations. The optimization problem is w...
Michael C. Ferris, Todd S. Munson, Krung Sinapirom...
JUCS
2008
91views more  JUCS 2008»
15 years 2 months ago
The Riemann Integral in Weak Systems of Analysis
: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce s...
Fernando Ferreira, Gilda Ferreira
CVPR
2003
IEEE
16 years 4 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
133
Voted
AAAI
2008
15 years 4 months ago
Hybrid Markov Logic Networks
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...
Jue Wang, Pedro Domingos
125
Voted
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
15 years 9 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann