Sciweavers

206 search results - page 40 / 42
» A Taxonomy of Cooperative Search Algorithms
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
CIKM
2008
Springer
13 years 9 months ago
Cache-aware load balancing for question answering
The need for high performance and throughput Question Answering (QA) systems demands for their migration to distributed environments. However, even in such cases it is necessary t...
David Dominguez-Sal, Mihai Surdeanu, Josep Aguilar...
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 1 months ago
Hill climbing on discrete HIFF: exploring the role of DNA transposition in long-term artificial evolution
We show how a random mutation hill climber that does multilevel selection utilizes transposition to escape local optima on the discrete Hierarchical-If-And-Only-If (HIFF) problem....
Susan Khor
AI
2010
Springer
13 years 7 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ECCV
2004
Springer
14 years 9 months ago
What Do Four Points in Two Calibrated Images Tell Us about the Epipoles?
Suppose that two perspective views of four world points are given, that the intrinsic parameters are known, but the camera poses and the world point positions are not. We prove tha...
David Nistér, Frederik Schaffalitzky