4860 search results - page 730 / 972 » SNPs Problems, Complexity, and Algorithms |
202
click to vote
IJRR
2010
15 years 5 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
172
click to vote
PVLDB
2008
15 years 5 months ago
2008
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
153
click to vote
MICS
2010
15 years 5 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
134
click to vote
TCS
2010
15 years 4 months ago
2010
We define a program semantics that is preserved by dependence-based slicing algorithms. It is a natural extension, to non-terminating programs, of the semantics introduced by Wei...
192
click to vote
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...