Sciweavers

4839 search results - page 28 / 968
» A survey of computational complexity results in systems and ...
Sort
View
IJCAI
2007
15 years 1 months ago
Hybrid Elections Broaden Complexity-Theoretic Resistance to Control
Electoral control refers to attempts by an election’s organizer (“the chair”) to influence the outcome by adding/deleting/partitioning voters or candidates. The groundbreak...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
FOCS
1995
IEEE
15 years 3 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 6 months ago
Using computer games for hybrid systems controller synthesis
Abstract-- We propose a formal method for feedback controller synthesis using interactive computer programs with graphical interface (in short, computer games). The main theoretica...
A. Agung Julius, Sina Afshari
ISPAN
1999
IEEE
15 years 4 months ago
Performance and Granularity Control in the SPaDES Parallel Simulation System
Parallel simulationhas the potentialto accelerate the execution of simulation applications. However, developing a parallel discrete-event simulation from scratch requires an in-de...
Yong Meng Teo, Seng Chuan Tay
LICS
2008
IEEE
15 years 6 months ago
On the Computational Complexity of Cut-Reduction
Using appropriate notation systems for proofs, cutreduction can often be rendered feasible on these notations. Explicit bounds can be given. Developing a suitable notation system ...
Klaus Aehlig, Arnold Beckmann