16404 search results - page 87 / 3281 » A set coverage problem |
121
click to vote
SSPR
2010
Springer
15 years 1 months ago
2010
Springer
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
116
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
124
click to vote
DAM
2007
15 years 3 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
128
click to vote
SODA
2010
ACM
16 years 14 days ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
138
click to vote
AIED
2009
Springer
15 years 9 months ago
2009
Springer
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...