Sciweavers

11151 search results - page 164 / 2231
» On the Complexity of Model Expansion
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 5 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 5 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
342
Voted
DLOG
2011
14 years 10 months ago
A Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motiva...
Milenko Mosurovic, Nenad Krdzavac
DAC
2000
ACM
16 years 8 months ago
Dynamic power management of complex systems using generalized stochastic Petri nets
In this paper, we introduce a new technique for modeling and solving the dynamic power management (DPM) problem for systems with complex behavioral characteristics such as concurr...
Qinru Qiu, Qing Wu, Massoud Pedram
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
16 years 1 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...