Sciweavers

3352 search results - page 32 / 671
» Hierarchical Problem Solving and the Bayesian Optimization A...
Sort
View
NIPS
1998
15 years 3 months ago
Efficient Bayesian Parameter Estimation in Large Discrete Domains
In this paper we examine the problem of estimating the parameters of a multinomial distribution over a large number of discreteoutcomes,most of which do not appearin the training ...
Nir Friedman, Yoram Singer
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 8 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
EAAI
2010
119views more  EAAI 2010»
15 years 1 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
CP
2005
Springer
15 years 8 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
AAAI
1996
15 years 3 months ago
Monitoring the Progress of Anytime Problem-Solving
Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. ...
Eric A. Hansen, Shlomo Zilberstein