1464 search results - page 96 / 293 » Behavioral optimization using the manipulation of timing con... |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
IEEECIT
2010
IEEE
13 years 7 months ago
2010
IEEE
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
—Robotic surgical assistants are enhancing physician performance, enabling physicians to perform more delicate and precise minimally invasive surgery. However, these devices are ...
PPPJ
2009
ACM
14 years 3 months ago
2009
ACM
Dynamic compilers can optimize application code specifically for observed code behavior. Such behavior does not have to be stable across the entire program execution to be bene...
CP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...