1403 search results - page 106 / 281 » Set cover algorithms for very large datasets |
123
click to vote
ICPP
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n − ...
130
click to vote
WEA
2007
Springer
15 years 10 months 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...
183
click to vote
ALGOSENSORS
2006
Springer
15 years 8 months ago
2006
Springer
Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power eci...
146
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
In empirical studies of Evolutionary Algorithms, it is usually desirable to evaluate and compare algorithms using as many different parameter settings and test problems as possible...
147
click to vote
PAKDD
2005
ACM
15 years 10 months ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...