9842 search results - page 388 / 1969 » The Complexity of the Matching-Cut Problem |
151
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
142
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
190
click to vote
TEC
2012
13 years 6 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
190
click to vote
FOGA
1998
15 years 5 months ago
1998
Genetic algorithms (GAs) are multi-dimensional and stochastic search methods, involving complex interactions among their parameters. For last two decades, researchers have been tr...
138
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...