Sciweavers

800 search results - page 55 / 160
» On the Complexity of Parity Games
Sort
View
COCO
2007
Springer
109views Algorithms» more  COCO 2007»
14 years 3 months ago
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier’s verdict is a function of the XOR of the tw...
Richard Cleve, William Slofstra, Falk Unger, Sarva...
FOSSACS
2007
Springer
14 years 3 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...
SAGT
2010
Springer
191views Game Theory» more  SAGT 2010»
13 years 7 months ago
Complexity of Safe Strategic Voting
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
Noam Hazon, Edith Elkind
CDC
2008
IEEE
168views Control Systems» more  CDC 2008»
14 years 3 months ago
An information-driven framework for motion planning in robotic sensor networks: Complexity and experiments
Abstract— A geometric optimization based approach to deploy a mobile sensor network for the purpose of detecting and capturing mobile targets in the plane is presented in [1]. Th...
Rafael Fierro, Silvia Ferrari, Chenghui Cai
EDM
2010
150views Data Mining» more  EDM 2010»
13 years 10 months ago
Modeling Learning Trajectories with Epistemic Network Analysis: A Simulation-based Investigation of a Novel Analytic Method for
Epistemic games are designed to help players develop domain-specific expertise that characterizes how professionals in a particular domain reason, communicate, and act [1, 11]. To ...
Andre A. Rupp, Shauna J. Sweet, Younyoung Choi