Sciweavers

1041 search results - page 10 / 209
» Randomizing Reductions of Search Problems
Sort
View
ISMIS
2003
Springer
14 years 26 days ago
Searching for the Complex Decision Reducts: The Case Study of the Survival Analysis
Generalization of the fundamental rough set discernibility tools aiming at searching for relevant patterns for complex decisions is discussed. As an example of application, there i...
Jan G. Bazan, Andrzej Skowron, Dominik Slezak, Jak...
SDM
2010
SIAM
153views Data Mining» more  SDM 2010»
13 years 9 months ago
The Generalized Dimensionality Reduction Problem
The dimensionality reduction problem has been widely studied in the database literature because of its application for concise data representation in a variety of database applica...
Charu C. Aggarwal
STTT
2010
120views more  STTT 2010»
13 years 2 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
SIGSOFT
2007
ACM
14 years 8 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
13 years 7 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius