Sciweavers

5316 search results - page 256 / 1064
» Which Search Problems Are Random
Sort
View
144
Voted
CSB
2004
IEEE
126views Bioinformatics» more  CSB 2004»
15 years 8 months ago
Boosted PRIM with Application to Searching for Oncogenic Pathway of Lung Cancer
Boosted PRIM (Patient Rule Induction Method) is a new algorithm developed for two-class classification problems. PRIM is a variation of those Tree-Based methods ( [4] Ch9.3), seek...
Pei Wang, Young Kim, Jonathan R. Pollack, Robert T...
IJAIT
2007
119views more  IJAIT 2007»
15 years 4 months ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
149
Voted
CORR
2012
Springer
174views Education» more  CORR 2012»
14 years 20 days ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
EVOW
2012
Springer
14 years 19 days ago
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
15 years 8 months ago
Evolutionary search for optimal combinations of markers in clothing manufacturing
Optimizing combinations of placements of parts, known as markers, is an important preparatory step in order-based industrial production of clothes. Given a work order in the form ...
Bogdan Filipic, Iztok Fister, Marjan Mernik