Sciweavers

376 search results - page 46 / 76
» Solution Counting Algorithms for Constraint-Centered Search ...
Sort
View
DMDW
2000
173views Management» more  DMDW 2000»
14 years 11 months ago
A quality-based framework for physical data warehouse design
Data warehousing is a software infrastructure which supports OLAP applications by providing a collection of tools which allow data extraction and cleaning, data integration and ag...
Mokrane Bouzeghoub, Zoubida Kedad
EVOW
2007
Springer
15 years 3 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz
62
Voted
GECCO
2009
Springer
139views Optimization» more  GECCO 2009»
15 years 2 months ago
Meta-heuristics for reconstructing cross cut shredded text documents
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...
Matthias Prandtstetter, Günther R. Raidl
AIPS
2000
14 years 11 months ago
Planning with Conflicting Advice
The paradigm of advisable planning, in which a user provides guidance to influence the content of solutions produced by an underlying planning system, holds much promise for impro...
Karen L. Myers
GECCO
2003
Springer
103views Optimization» more  GECCO 2003»
15 years 2 months ago
Multicriteria Network Design Using Evolutionary Algorithm
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
Rajeev Kumar, Nilanjan Banerjee