465 search results - page 29 / 93 » On the Hardness of Range Assignment Problems |
114
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
Bid-based Genetic Programming (GP) provides an elegant mechanism for facilitating cooperative problem decomposition without an a priori specification of the number of team member...
149
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
136
click to vote
IMCSIT
2010
14 years 12 months ago
2010
In our work we present a new approach to the problem of channel assignment in Wireless Ad Hoc Network. We introduce a new algorithm which works in distributed model of computations...
109
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Numerous domains ranging from distributed data acquisition to knowledge reuse need to solve the cluster ensemble problem of combining multiple clusterings into a single unified cl...
119
click to vote
FOCS
2000
IEEE
15 years 6 months ago
2000
IEEE
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...