4103 search results - page 72 / 821 » Some results on the Collatz problem |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
100
click to vote
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
128
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
107
click to vote
CEC
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...