5170 search results - page 109 / 1034 » Consistency of the FastSLAM Algorithm |
EOR
2010
15 years 2 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
114
Voted
IJMC
2006
15 years 2 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
136
Voted
ISM
2008
IEEE
15 years 9 months ago
2008
IEEE
Error concealment is very important for video communication as an application-layer error control mechanism which can be used independently of the underlying communication infrast...
124
Voted
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
118
Voted
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...