Sciweavers

1221 search results - page 153 / 245
» Balanced graph partitioning
Sort
View
IROS
2006
IEEE
113views Robotics» more  IROS 2006»
14 years 4 months ago
A Framework for Automatic Deployment of Robots in 2D and 3D Environments
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
Marius Kloetzer, Calin Belta
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
14 years 3 months ago
Power Constrained High-Level Synthesis of Battery Powered Digital Systems
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
S. F. Nielsen, Jan Madsen
IPPS
2000
IEEE
14 years 2 months ago
Optimization of Motion Estimator for Run-Time-Reconfiguration Implementation
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
Camel Tanougast, Yves Berviller, Serge Weber
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
14 years 1 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...
SIROCCO
2008
13 years 11 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker