871 search results - page 166 / 175 » The vertex-cover polynomial of a graph |
163
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
A Distributed Constraint Optimization Problem (DCOP) is a fundamental problem that can formalize various applications related to multi-agent cooperation. Since it is NP-hard, consi...
93
Voted
RECOMB
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
107
click to vote
STOC
2004
ACM
16 years 5 days ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
170
click to vote
SIGMOD
2009
ACM
16 years 3 days ago
2009
ACM
views abstract groups of tasks in a workflow into high level composite tasks, in order to reuse sub-workflows and facilitate provenance analysis. However, unless a view is careful...
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...