Sciweavers

2657 search results - page 392 / 532
» On the complexity of hierarchical problem solving
Sort
View
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
CPM
2009
Springer
122views Combinatorics» more  CPM 2009»
15 years 4 months ago
Haplotype Inference Constrained by Plausible Haplotype Data
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...
Michael R. Fellows, Tzvika Hartman, Danny Hermelin...
AAAI
2006
14 years 11 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
ALMOB
2006
113views more  ALMOB 2006»
14 years 10 months ago
Inverse bifurcation analysis: application to simple gene systems
Background: Bifurcation analysis has proven to be a powerful method for understanding the qualitative behavior of gene regulatory networks. In addition to the more traditional for...
James Lu, Heinz W. Engl, Peter Schuster
TCS
2008
14 years 10 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul