Sciweavers

516 search results - page 71 / 104
» Generalizing the Discrete Timed Automaton
Sort
View
CPM
2009
Springer
189views Combinatorics» more  CPM 2009»
14 years 4 months ago
Average-Case Analysis of Perfect Sorting by Reversals
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
Mathilde Bouvel, Cedric Chauve, Marni Mishna, Domi...
ISLPED
2009
ACM
184views Hardware» more  ISLPED 2009»
14 years 4 months ago
Online work maximization under a peak temperature constraint
Increasing power densities and the high cost of low thermal resistance packages and cooling solutions make it impractical to design processors for worst-case temperature scenarios...
Thidapat Chantem, Xiaobo Sharon Hu, Robert P. Dick
ICRA
2007
IEEE
131views Robotics» more  ICRA 2007»
14 years 4 months ago
Simulation Issues in Haptics
Abstract— In this paper, two problems related to the simulation of virtual environments for haptic systems are considered. The first problem is how to simulate, in discrete time...
Gianni Borghesan, Alessandro Macchelli, Claudio Me...
IROS
2006
IEEE
104views Robotics» more  IROS 2006»
14 years 3 months ago
Optimal Trajectory Generation for Manipulator Robots under Thermal Constraints
We propose here to deal with the optimization of velocity profiles of manipulator robots with a minimum time criterion subject to thermal constraints. This paper deals with the r...
Matthieu Guilbert, Pierre-Brice Wieber, Luc D. Jol...
COMPGEOM
2004
ACM
14 years 3 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato