4860 search results - page 281 / 972 » SNPs Problems, Complexity, and Algorithms |
119
Voted
IWPEC
2004
Springer
15 years 6 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
108
Voted
AAAI
2000
15 years 2 months ago
2000
This paper addresses the problem of tracking and diagnosing complex systems with mixtures of discrete and continuous variables. This problem is a difficult one, particularly when ...
DIALM
2004
ACM
15 years 6 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
119
Voted
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
JCSS
2007
15 years 18 days ago
2007
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...