Sciweavers

719 search results - page 133 / 144
» Solving Sparse Linear Constraints
Sort
View
CPAIOR
2009
Springer
16 years 3 days ago
A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
IROS
2008
IEEE
126views Robotics» more  IROS 2008»
15 years 12 months ago
High-dimensional underactuated motion planning via task space control
Abstract— Kinodynamic planning algorithms have the potential to find feasible control trajectories which accomplish a task even in very nonlinear or constrained dynamical system...
Alexander C. Shkolnik, Russ Tedrake
SOCC
2008
IEEE
124views Education» more  SOCC 2008»
15 years 12 months ago
Energy minimization using a greedy randomized heuristic for the voltage assignment problem in NoC
— Scaling down the voltage levels of the processing elements (PEs) in a Network-on-Chip (NoC) can significantly reduce the computation energy consumption with an overhead of the...
Pavel Ghosh, Arunabha Sen
134
Voted
ASPDAC
2006
ACM
119views Hardware» more  ASPDAC 2006»
15 years 11 months ago
Using speculative computation and parallelizing techniques to improve scheduling of control based designs
Recent research results have seen the application of parallelizing techniques to high-level synthesis. In particular, the effect of speculative code transformations on mixed contr...
Roberto Cordone, Fabrizio Ferrandi, Marco D. Santa...
ECML
2005
Springer
15 years 11 months ago
Annealed Discriminant Analysis
Abstract. Motivated by the analogies to statistical physics, the deterministic annealing (DA) method has successfully been demonstrated in a variety of application. In this paper, ...
Gang Wang, Zhihua Zhang, Frederick H. Lochovsky