Sciweavers

2561 search results - page 189 / 513
» Enhanced Quicksort Algorithm
Sort
View
AAAI
2007
15 years 4 months ago
Propagating Knapsack Constraints in Sublinear Time
We develop an efficient incremental version of an existing cost-based filtering algorithm for the knapsack constraint. On a universe of n elements, m invocations of the algorith...
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal ...
AAAI
2010
15 years 4 months ago
Learning Causal Models of Relational Domains
Methods for discovering causal knowledge from observational data have been a persistent topic of AI research for several decades. Essentially all of this work focuses on knowledge...
Marc Maier, Brian Taylor, Huseyin Oktay, David Jen...
ESANN
2004
15 years 3 months ago
Forbidden Magnification? I
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control ...
Abha Jain, Erzsébet Merényi
106
Voted
AAAI
1997
15 years 3 months ago
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
Roberto J. Bayardo Jr., Robert Schrag
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 3 months ago
Theoretical analysis of diversity mechanisms for global exploration
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
Tobias Friedrich, Pietro Simone Oliveto, Dirk Sudh...