Sciweavers

356 search results - page 31 / 72
» Solving the Small Sample Size Problem of LDA
Sort
View
ICTAI
2007
IEEE
14 years 1 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
SCL
2008
56views more  SCL 2008»
13 years 7 months ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
DAM
2011
13 years 2 months ago
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
This paper considers a single-vehicle Dial-a-Ride problem in which customers may experience stochastic delays at their pickup locations. If a customer is absent when the vehicle s...
Géraldine Heilporn, Jean-François Co...
COCOON
2010
Springer
13 years 11 months ago
A Three-String Approach to the Closest String Problem
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
Zhi-Zhong Chen, Bin Ma, Lusheng Wang
CEC
2010
IEEE
13 years 7 months ago
Towards probabilistic memetic algorithm: An initial study on capacitated arc routing problem
— Capacitated arc routing problem (CARP) has attracted much attention due to its generality to many real world problems. Memetic algorithm (MA), among other metaheuristic search ...
Liang Feng, Yew-Soon Ong, Quang Huy Nguyen 0001, A...