1522 search results - page 84 / 305 » On the Complexity of Several Haplotyping Problems |
JCP
2006
13 years 7 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
JCP
2007
13 years 7 months ago
2007
—The article presents an approach to the development of multi-attribute decision making model that is based on DEX, an expert system shell for multi-attribute decision support. W...
WG
2010
Springer
13 years 6 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
A fundamental problem in numerical computation and computational geometry is to determine the sign of arithmetic expressions in radicals. Here we consider the simpler problem of d...
AUTOMATICA
2011
13 years 2 months ago
2011
An asynchronous stochastic approximation based (Frequentist) approach is proposed for mapping using noisy mobile sensors under two different scenarios: 1) perfectly known sensor ...