Sciweavers

130 search results - page 18 / 26
» Binary Representations for General CSPs
Sort
View
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
14 years 3 months ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
ICLP
2009
Springer
14 years 9 months ago
Encoding Table Constraints in CLP(FD) Based on Pair-Wise AC
We present an implementation of table constraints in CLP(FD). For binary constraints, the supports of each value are represented as a finite-domain variable, and action rules are u...
Neng-Fa Zhou
SIGIR
2006
ACM
14 years 2 months ago
Feature diversity in cluster ensembles for robust document clustering
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
Xavier Sevillano, Germán Cobo, Francesc Al&...
CVPR
2010
IEEE
13 years 10 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ICFEM
2010
Springer
13 years 7 months ago
Making the Right Cut in Model Checking Data-Intensive Timed Systems
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
Rüdiger Ehlers, Michael Gerke 0002, Hans-J&ou...