Sciweavers

Share
ICALP
2003
Springer
9 years 1 months ago
Hierarchical and Recursive State Machines with Context-Dependent Properties
Abstract. Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by al...
Salvatore La Torre, Margherita Napoli, Mimmo Paren...
ICALP
2003
Springer
9 years 1 months ago
A Testing Scenario for Probabilistic Automata
Mariëlle Stoelinga, Frits W. Vaandrager
ICALP
2003
Springer
9 years 1 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
ICALP
2003
Springer
9 years 1 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen
ICALP
2003
Springer
9 years 1 months ago
Succinct Dynamic Dictionaries and Trees
Rajeev Raman, S. Srinivasa Rao
ICALP
2003
Springer
9 years 1 months ago
Quantitative Analysis of Probabilistic Lossy Channel Systems
Many protocols are designed to operate correctly even in the case where the underlying communication medium is faulty. To capture the behaviour of such protocols, lossy channel sy...
Alexander Moshe Rabinovich
ICALP
2003
Springer
9 years 1 months ago
Real-Time Scheduling with a Budget
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
Joseph Naor, Hadas Shachnai, Tami Tamir
ICALP
2003
Springer
9 years 1 months ago
Bisimulation Proof Methods for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients. We give an lts based operational semantics, and a labelled bisimulation based equivalence that coincide...
Massimo Merro, Francesco Zappa Nardelli
ICALP
2003
Springer
9 years 1 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ICALP
2003
Springer
9 years 1 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
books