16404 search results - page 458 / 3281 » A set coverage problem |
185
click to vote
TOC
2010
15 years 1 months ago
2010
: We consider the Submodular Welfare Problem where we have m items and n players with given utility functions wi : 2[m] R+. The utility functions are assumed to be monotone and su...
272
click to vote
FOGA
2011
14 years 10 months ago
2011
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
182
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
156
click to vote
IAT
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we introduce the Semi-Cooperative Extended Incremental Multiagent Agreement Problem with Preferences (SC-EIMAPP). In SC-EIMAPPs, variables arise over time. For each ...
160
click to vote
AIMSA
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...