Sciweavers

2100 search results - page 93 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
TRANSCI
2010
98views more  TRANSCI 2010»
13 years 3 months ago
The Vehicle Routing Problem with Stochastic Demand and Duration Constraints
Time considerations have been largely ignored in the study of vehicle routing problems with stochastic demands, even though they are crucial in practice. We show that tour duratio...
Alan L. Erera, Juan C. Morales, Martin W. P. Savel...
CEC
2005
IEEE
14 years 2 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Bart G. W. Craenen, A. E. Eiben
ICASSP
2009
IEEE
14 years 22 days ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
EVOW
2006
Springer
14 years 16 days ago
Fast EAX Algorithm Considering Population Diversity for Traveling Salesman Problems
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...
Yuichi Nagata
TKDE
2008
126views more  TKDE 2008»
13 years 8 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...