Sciweavers

2343 search results - page 354 / 469
» Visual-Concept Search Solved
Sort
View
DAWAK
2004
Springer
15 years 11 months ago
Algorithms for Discovery of Frequent Superset, Rather than Frequent Subset
Abstract. In this paper, we propose a novel mining task: mining frequent superset from the database of itemsets that is useful in bioinformatics, e-learning systems, jobshop schedu...
Zhung-Xun Liao, Man-Kwan Shan
ECAI
2004
Springer
15 years 11 months ago
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Alan M. Frisch, Christopher Jefferson, Ian Miguel
ECAI
2004
Springer
15 years 11 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
15 years 11 months ago
An Island-Based GA Implementation for VLSI Standard-Cell Placement
Genetic algorithms require relatively large computation time to solve optimization problems, especially in VLSI CAD such as module placement. Therefore, island-based parallel GAs a...
Guangfa Lu, Shawki Areibi
154
Voted
PATAT
2004
Springer
138views Education» more  PATAT 2004»
15 years 11 months ago
Semantic Components for Timetabling
Abstract. Automated timetabling is a research domain that has occupied many researchers over the last 50 years. Several algorithms have proven to be applicable to timetabling but t...
Nele Custers, Patrick De Causmaecker, Peter Demees...