Sciweavers

15777 search results - page 2538 / 3156
» Software Engineering
Sort
View
FSTTCS
2009
Springer
16 years 1 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...
FSTTCS
2009
Springer
16 years 1 months ago
On Timed Alternating Simulation for Concurrent Timed Games
We address the problem of alternating simulation refinement for concurrent timed games (TG). We show that checking timed alternating simulation between TG is EXPTIME-complete, and...
Laura Bozzelli, Axel Legay, Sophie Pinchinat
FSTTCS
2009
Springer
16 years 1 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
FSTTCS
2009
Springer
16 years 1 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
FSTTCS
2009
Springer
16 years 1 months ago
Automata and temporal logic over arbitrary linear time
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running sys...
Julien Cristau
« Prev « First page 2538 / 3156 Last » Next »