1522 search results - page 61 / 305 » On the Complexity of Several Haplotyping Problems |
KES
1998
Springer
15 years 1 months ago
1998
Springer
Robotic controllers take advantage from neural network learning capabilities as long as the dimensionality of the problem is kept moderate. This paper explores the possibilities of...
60
Voted
ENDM
2007
14 years 9 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
FUIN
2010
14 years 7 months ago
2010
This paper explores the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper ...
AAAI
2012
13 years 3 days ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
113
click to vote
AAAI
2012
13 years 3 days ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...