Sciweavers

29 search results - page 2 / 6
» On the Expressiveness of MTL Variants over Dense Time
Sort
View
LICS
2010
IEEE
13 years 3 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
13 years 9 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
FORMATS
2006
Springer
13 years 9 months ago
A Dose of Timed Logic, in Guarded Measure
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
Kamal Lodaya, Paritosh K. Pandya
SIGECOM
2004
ACM
96views ECommerce» more  SIGECOM 2004»
13 years 10 months ago
Expressive negotiation over donations to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as negotiating material to induce other parties interested in the charity to dona...
Vincent Conitzer, Tuomas Sandholm
DAWAK
2007
Springer
13 years 9 months ago
Mining First-Order Temporal Interval Patterns with Regular Expression Constraints
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
Sandra de Amo, Arnaud Giacometti, Waldecir Pereira...