Sciweavers

225 search results - page 13 / 45
» A Least-Certainty Heuristic for Selective Search
Sort
View
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
14 years 3 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
ICPR
2008
IEEE
14 years 3 months ago
Fast model selection for MaxMinOver-based training of support vector machines
OneClassMaxMinOver (OMMO) is a simple incremental algorithm for one-class support vector classification. We propose several enhancements and heuristics for improving model select...
Fabian Timm, Sascha Klement, Thomas Martinetz
ECAI
2006
Springer
14 years 23 days ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 22 days ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens
ASPDAC
2006
ACM
118views Hardware» more  ASPDAC 2006»
14 years 3 months ago
Task placement heuristic based on 3D-adjacency and look-ahead in reconfigurable systems
To get efficient HW management in 2D Reconfigurable Systems, heuristics are needed to select the best place to locate each arriving task. We propose a technique that locates the ta...
Jesús Tabero, Julio Septién, Hortens...