Sciweavers

2850 search results - page 98 / 570
» On Timed Models and Full Abstraction
Sort
View
ESA
2008
Springer
95views Algorithms» more  ESA 2008»
15 years 8 months ago
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prud...
ICALP
2003
Springer
16 years 3 days ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
FOSSACS
2004
Springer
16 years 8 days ago
A Game Semantics of Local Names and Good Variables
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
James Laird
APLAS
2001
ACM
15 years 10 months ago
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
Masahito Hasegawa
EPK
2006
114views Management» more  EPK 2006»
15 years 8 months ago
Verifying Properties of (Timed) Event Driven Process Chains by Transformation to Hybrid Automata
Abstract: Event-driven Process Chains (EPCs) are a commonly used modelling technique for design and documentation of business processes. Although EPCs have an easy-to-understand no...
Stefan Denne