Sciweavers

2273 search results - page 74 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
15 years 1 months ago
On the Complexity of Boolean Functions in Different Characteristics
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
Parikshit Gopalan, Shachar Lovett, Amir Shpilka
HYBRID
2000
Springer
15 years 1 months ago
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
Joseph S. Miller
CIKM
2008
Springer
14 years 11 months ago
Scalable complex pattern search in sequential data
Searching data streams has been traditionally very limited, either in the complexity of the search or in the size of the searched dataset. In this paper, we investigate the design...
Leila Kaghazian, Dennis McLeod, Reza Sadri
VVEIS
2007
14 years 11 months ago
Checking Complex Compositions of Web Services Against Policy Constraints
Research in web services has allowed reusable, distributed, loosely coupled components which can easily be composed to build systems or to produce more complex services. Compositio...
Andrew Dingwall-Smith, Anthony Finkelstein
LOGCOM
2010
96views more  LOGCOM 2010»
14 years 8 months ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis