Sciweavers

944 search results - page 70 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
116
Voted
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
TSP
2008
100views more  TSP 2008»
14 years 10 months ago
Optimal Two-Stage Search for Sparse Targets Using Convex Criteria
We consider the problem of estimating and detecting sparse signals over a large area of an image or other medium. We introduce a novel cost function that captures the tradeoff bet...
Eran Bashan, Raviv Raich, Alfred O. Hero III
145
Voted
GECCO
2007
Springer
558views Optimization» more  GECCO 2007»
15 years 4 months ago
A chain-model genetic algorithm for Bayesian network structure learning
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
Ratiba Kabli, Frank Herrmann, John McCall
GECCO
2003
Springer
130views Optimization» more  GECCO 2003»
15 years 3 months ago
Extracting Test Sequences from a Markov Software Usage Model by ACO
The aim of the paper is to investigate methods for deriving a suitable set of test paths for a software system. The design and the possible uses of the software system are modelled...
Karl Doerner, Walter J. Gutjahr
129
Voted
ADBIS
2007
Springer
256views Database» more  ADBIS 2007»
15 years 2 months ago
Adaptive k-Nearest-Neighbor Classification Using a Dynamic Number of Nearest Neighbors
Classification based on k-nearest neighbors (kNN classification) is one of the most widely used classification methods. The number k of nearest neighbors used for achieving a high ...
Stefanos Ougiaroglou, Alexandros Nanopoulos, Apost...