Sciweavers

145 search results - page 24 / 29
» BQP and the Polynomial Hierarchy
Sort
View
145
Voted
SCOPES
2004
Springer
15 years 7 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
138
Voted
ARGMAS
2006
Springer
15 years 5 months ago
Specification and Complexity of Strategic-Based Reasoning Using Argumentation
Abstract. In this paper, we propose a new strategic and tactic reasoning for agent communication. This reasoning framework is specified using argumentation theory combined to a rel...
Mohamed Mbarki, Jamal Bentahar, Bernard Moulin
86
Voted
KR
2000
Springer
15 years 5 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
105
Voted
DOOD
1995
Springer
128views Database» more  DOOD 1995»
15 years 5 months ago
Authorization Analysis of Queries in Object-Oriented Databases
Abstract. A simple model for method-based authorization is defined and an algorithm is presented for testing in compile-time whether a given database schema violates authorization...
Hiroyuki Seki, Yasunori Ishihara, Minoru Ito
COMPGEOM
2008
ACM
15 years 3 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos