Sciweavers

2957 search results - page 399 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
PATMOS
2007
Springer
16 years 1 months ago
Fast Calculation of Permissible Slowdown Factors for Hard Real-Time Systems
This work deals with the problem to optimise the energy consumption of an embedded system. On system level, tasks are assumed to have a certain CPU-usage they need for completion. ...
Henrik Lipskoch, Karsten Albers, Frank Slomka
SOFSEM
2007
Springer
16 years 1 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
205
Voted
3DPVT
2006
IEEE
176views Visualization» more  3DPVT 2006»
16 years 1 months ago
Belief Propagation for Panorama Generation
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
Alan Brunton, Chang Shu
142
Voted
ICRA
2006
IEEE
77views Robotics» more  ICRA 2006»
16 years 1 months ago
Scalable Shape Sculpting via Hole Motion: Motion Planning in Lattice-constrained Modular Robots
— We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the latt...
Michael DeRosa, Seth Copen Goldstein, Peter Lee, J...
RTCSA
2006
IEEE
16 years 1 months ago
Characterization and Analysis of Tasks with Offsets: Monotonic Transactions
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...
Karim Traore, Emmanuel Grolleau, Francis Cottet