Sciweavers

5289 search results - page 467 / 1058
» Evolutionary Computation for Modeling and Optimization
Sort
View
ICPR
2008
IEEE
16 years 1 months ago
Improving Bayesian Network parameter learning using constraints
This paper describes a new approach to unify constraints on parameters with training data to perform parameter estimation in Bayesian networks of known structure. The method is ge...
Cassio Polpo de Campos, Qiang Ji
CLEF
2007
Springer
16 years 1 months ago
Speeding Up IDM without Degradation of Retrieval Quality
The Image Distortion Model (IDM) has shown good retrieval quality in previous runs of the medical automatic annotation task of previous ImageCLEF workshops. However, one of its li...
Michael Springmann, Heiko Schuldt
WG
2007
Springer
16 years 28 days ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...
236
Voted
COMPGEOM
2010
ACM
15 years 12 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
16 years 1 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...