2366 search results - page 139 / 474 » Mapping time |
122
click to vote
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
113
Voted
IROS
2006
IEEE
15 years 9 months ago
2006
IEEE
— Today, lightweight SLAM algorithms are needed in many embedded robotic systems. In this paper the Orthogonal SLAM (OrthoSLAM ) algorithm is presented and empirically validated....
144
Voted
FAC
2000
15 years 3 months ago
2000
In this paper we present a method of describing microprocessors at different levels of temporal and data abstraction. We consider microprogrammed, pipelined and superscalar proces...
118
Voted
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
124
Voted
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
A state-of-the-art orthogonal frequency division multiplexing (OFDM)-based access system, such as the DiffSeg system [1][2], uses a different set of transmission technologies, e.g...