1300 search results - page 194 / 260 » Constraint satisfaction problems and global cardinality cons... |
IJIIDS
2008
14 years 9 months ago
2008
: Global Navigation Satellite Systems (GNSS) are often used to localise a receiver with respect to a given map. This association problem, also known as map-matching, is usually add...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...
TCS
2008
14 years 9 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
The process of creating e-learning contents using reusable learning objects (LOs) can be broken down in two sub-processes: LOs finding and LO sequencing. Sequencing is usually per...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...