Sciweavers

617 search results - page 97 / 124
» Local Search for Heuristic Guidance in Tree Search
Sort
View
IJCAI
2007
13 years 9 months ago
Domain Independent Approaches for Finding Diverse Plans
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a do...
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevin...
AE
2009
Springer
13 years 9 months ago
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
ICML
2010
IEEE
13 years 9 months ago
Hilbert Space Embeddings of Hidden Markov Models
Hidden Markov Models (HMMs) are important tools for modeling sequence data. However, they are restricted to discrete latent states, and are largely restricted to Gaussian and disc...
Le Song, Sajid M. Siddiqi, Geoffrey J. Gordon, Ale...
IEICET
2006
55views more  IEICET 2006»
13 years 8 months ago
Inserting Points Uniformly at Every Instance
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjam...
GECCO
2004
Springer
14 years 1 months ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer