Sciweavers

4894 search results - page 870 / 979
» Dynamic Abstraction Planning
Sort
View
68
Voted
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 10 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
Juyul Lee, Nihar Jindal
CORR
2008
Springer
125views Education» more  CORR 2008»
14 years 10 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre
FUIN
2008
147views more  FUIN 2008»
14 years 10 months ago
A Basic Logic for Reasoning about Connector Reconfiguration
Abstract. Software systems evolve over time. From a component-based software engineering perspective, this means that either the components of the system need to change, or, if com...
Dave Clarke
IANDC
2008
84views more  IANDC 2008»
14 years 10 months ago
A theory of system behaviour in the presence of node and link failure
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
Adrian Francalanza, Matthew Hennessy
CL
2006
Springer
14 years 10 months ago
Runtime bytecode transformation for Smalltalk
Transforming programs to alter their semantics is of wide interest, for purposes as diverse as off-the-shelf component adaptation, optimization,tracegeneration,andexperimentationw...
Marcus Denker, Stéphane Ducasse, Éri...