This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
Jonathan K. Lee, Jens Palsberg, Fernando Magno Qui...
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...
Abstract. Previous work [51] showed how to solve time-fractional diffusion equations by particle tracking. This paper extends the method to the case where the order of the fraction...
SARC merges cache controller and network interface functions by relying on a single hardware primitive: each access checks the tag and the state of the addressed line for possible...