Sciweavers

6095 search results - page 748 / 1219
» Learning in Local Search
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Heuristics for Dynamically Adapting Propagation
Building adaptive constraint solvers is a major challenge in constraint programming. An important line of research towards this goal is concerned with ways to dynamically adapt th...
Kostas Stergiou
AI
2008
Springer
15 years 7 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
BMCBI
2007
136views more  BMCBI 2007»
15 years 7 months ago
Genomorama: genome visualization and analysis
Background: The ability to visualize genomic features and design experimental assays that can target specific regions of a genome is essential for modern biology. To assist in the...
Jason D. Gans, Murray Wolinsky
183
Voted
AI
2000
Springer
15 years 6 months ago
A Lagrangian reconstruction of GENET
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
Kenneth M. F. Choi, Jimmy Ho-Man Lee, Peter J. Stu...
FLAIRS
2004
15 years 8 months ago
The Optimality of Naive Bayes
Naive Bayes is one of the most efficient and effective inductive learning algorithms for machine learning and data mining. Its competitive performance in classification is surpris...
Harry Zhang