Sciweavers

1522 search results - page 10 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 11 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
COCOA
2007
Springer
14 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
STOC
1997
ACM
116views Algorithms» more  STOC 1997»
13 years 11 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson
EAAI
2010
119views more  EAAI 2010»
13 years 6 months ago
A heuristic-based framework to solve a complex aircraft sizing problem
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Céline Badufle, Christophe Blondel, Thierry...
AAAI
2012
11 years 10 months ago
Learning Games from Videos Guided by Descriptive Complexity
In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for speci...
Lukasz Kaiser