Sciweavers

9626 search results - page 1268 / 1926
» Invariant Based Programming
Sort
View
206
Voted
IROS
2007
IEEE
126views Robotics» more  IROS 2007»
16 years 1 months ago
A graph theoretic approach to optimal target tracking for mobile robot teams
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...
Jason C. Derenick, John R. Spletzer, M. Ani Hsieh
188
Voted
CC
2007
Springer
126views System Software» more  CC 2007»
16 years 1 months ago
An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architectures
This paper presents a compiler technique that reduces the energy consumption of the memory subsystem, for an off-chip partitioned memory architecture having multiple memory banks ...
K. Shyam, R. Govindarajan
171
Voted
CONCUR
2007
Springer
16 years 1 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram
190
Voted
CP
2007
Springer
16 years 1 months ago
Constructive Interval Disjunction
Shaving and constructive disjunction are two main refutation principles used in constraint programming. The shaving principle allows us to compute the singleton arc-consistency (SA...
Gilles Trombettoni, Gilles Chabert
235
Voted
EUROPAR
2007
Springer
16 years 1 months ago
Esodyp+: Prefetching in the Jackal Software DSM
Abstract. Prefetching transfers a data item in advance from its storage location to its usage location so that communication is hidden and does not delay computation. We present a ...
Michael Klemm, Jean Christophe Beyler, Ronny T. La...
« Prev « First page 1268 / 1926 Last » Next »