4860 search results - page 557 / 972 » SNPs Problems, Complexity, and Algorithms |
141
Voted
AAAI
2010
15 years 6 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
147
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
124
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
133
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
We study the complexity of manipulation for a family of election systems derived from Copeland voting via introducing a parameter that describes how ties in head-to-head contests...
260
click to vote
LCC
1994
15 years 8 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...