Sciweavers

13621 search results - page 67 / 2725
» Computability and Complexity in Self-assembly
Sort
View
FOCS
1997
IEEE
14 years 2 months ago
Computable Obstructions to Wait-free Computability
Abstract. We show how to associate e ectively computableobstructions to a waitfree distributed decision task (I;O; ) in the asynchronous shared-memory, readwrite model. The key new...
John Havlicek
ECCC
2007
90views more  ECCC 2007»
13 years 10 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CORR
2012
Springer
182views Education» more  CORR 2012»
12 years 5 months ago
Organizing the Aggregate: Languages for Spatial Computing
As the number of computing devices embedded into engineered systems continues to rise, there is a widening gap between the needs of the user to control aggregates of devices and t...
Jacob Beal, Stefan Dulman, Kyle Usbeck, Mirko Viro...
AAAI
2012
12 years 11 days ago
Computing Optimal Strategies to Commit to in Stochastic Games
Significant progress has been made recently in the following two lines of research in the intersection of AI and game theory: (1) the computation of optimal strategies to commit ...
Joshua Letchford, Liam MacDermed, Vincent Conitzer...
AGI
2011
13 years 1 months ago
What Makes a Brain Smart? Reservoir Computing as an Approach for General Intelligence
Abstract. Recurrent connectivity, balanced between excitation and inhibition, is a general principle of cortical connectivity. We propose that balanced recurrence can be achieved b...
Janelle Szary, Bryan Kerster, Christopher T. Kello