Sciweavers

11565 search results - page 155 / 2313
» Computing Minimal Mappings
Sort
View
RSP
2007
IEEE
143views Control Systems» more  RSP 2007»
15 years 10 months ago
Heuristics for Dynamic Task Mapping in NoC-based Heterogeneous MPSoCs
Multiprocessor Systems-on-Chip (MPSoCs) is a trend in VLSI design, since they minimize the “design crisis” (gap between silicon technology and actual SoC design capacity) and ...
Ewerson Carvalho, Ney Calazans, Fernando Moraes
ICPR
2002
IEEE
16 years 5 months ago
Concurrent Map Building and Localization with Landmark Validation
This communication addresses the issue of concurrent map building and localization (CML) for a mobile robot in an unknown environment. The proposed solution extends over previous ...
Juan Andrade-Cetto, Alberto Sanfeliu
MOBIHOC
2006
ACM
16 years 4 months ago
Minimizing recovery state In geographic ad-hoc routing
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach...
Noa Arad, Yuval Shavitt
ICDCS
2009
IEEE
16 years 1 months ago
Minimizing the Hidden Cost of RDMA
Remote Direct Memory Access (RDMA) is a mechanism whereby data is moved directly between the application memory of the local and remote computer. In bypassing the operating system...
Philip Werner Frey, Gustavo Alonso
DSN
2009
IEEE
15 years 11 months ago
VNsnap: Taking snapshots of virtual networked environments with minimal downtime
A virtual networked environment (VNE) consists of virtual machines (VMs) connected by a virtual network. It has been adopted to create “virtual infrastructures” for individual...
Ardalan Kangarlou, Patrick Eugster, Dongyan Xu