357 search results - page 55 / 72 » Algorithms for the coalitional manipulation problem |
200
Voted
POPL
2004
ACM
16 years 20 days ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
102
click to vote
BMCBI
2010
15 years 14 days ago
2010
Background: The use of ontologies to control vocabulary and structure annotation has added value to genomescale data, and contributed to the capture and re-use of knowledge across...
106
click to vote
KDD
1999
ACM
15 years 4 months ago
1999
ACM
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
101
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Evolutionary Computation is an exciting research field with the power to assist researchers in the task of solving hard optimization problems (i.e., problems where the exploitabl...
108
click to vote
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...