Sciweavers

2150 search results - page 96 / 430
» On a restricted cross-intersection problem
Sort
View
CONCUR
2009
Springer
15 years 11 months ago
Concavely-Priced Probabilistic Timed Automata
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...
113
Voted
CPAIOR
2009
Springer
15 years 11 months ago
Open Constraints in a Boundable World
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
Michael J. Maher
114
Voted
ICMCS
2007
IEEE
153views Multimedia» more  ICMCS 2007»
15 years 10 months ago
Towards Adversary Aware Surveillance Systems
We consider surveillance problems to be a set of system- adversary interaction problems in which an adversary can be modeled as a rational (selfish) agent trying to maximize his ...
Vivek K. Singh, Mohan S. Kankanhalli
ICDT
2003
ACM
126views Database» more  ICDT 2003»
15 years 9 months ago
Typechecking Top-Down Uniform Unranked Tree Transducers
We investigate the typechecking problem for XML queries: statically verifying that every answer to a query conforms to a given output schema, for inputs satisfying a given input sc...
Wim Martens, Frank Neven
DATE
1999
IEEE
123views Hardware» more  DATE 1999»
15 years 8 months ago
An Algorithm for Face-Constrained Encoding of Symbols Using Minimum Code Length
Different logic synthesis tasks have been formulated as input encoding problems but restricted to use a minimum number of binary variables. This paper presents an original column ...
Manuel Martínez, Maria J. Avedillo, Jos&eac...