16404 search results - page 459 / 3281 » A set coverage problem |
157
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
199
click to vote
ISBI
2007
IEEE
16 years 1 months ago
2007
IEEE
The concept of “Space-Time Sparsity” (STS) penalization is introduced for solving the magnetoencephalography (MEG) inverse problem. The STS approach assumes that events of int...
190
click to vote
PPAM
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
154
click to vote
WADS
2007
Springer
16 years 27 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
174
click to vote
WEA
2007
Springer
16 years 27 days ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...