Sciweavers

8695 search results - page 17 / 1739
» Making the Complex Simple
Sort
View
ICALP
2009
Springer
14 years 8 months ago
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
Michael Ummels, Dominik Wojtczak
IROS
2009
IEEE
164views Robotics» more  IROS 2009»
14 years 2 months ago
Complex networks of simple neurons for bipedal locomotion
— Fluid bipedal locomotion remains a significant challenge for humanoid robotics. Recent bio-inspired approaches have made significant progress by using small numbers of tightl...
Brian F. Allen, Petros Faloutsos
JOCN
2010
95views more  JOCN 2010»
13 years 6 months ago
Visual Short-term Memory Capacity for Simple and Complex Objects
■ Does the capacity of visual short-term memory (VSTM) depend on the complexity of the objects represented in memory? Although some previous findings indicated lower capacity fo...
Roy Luria, Paola Sessa, Alex Gotler, Pierre Jolico...
TCS
2008
13 years 7 months ago
Sequential vs. parallel complexity in simple gene assembly
We investigate some differences between the general intramolecular model for gene assembly and its restricted simple model. Although both models satisfactorily sort all current ex...
Miika Langille, Ion Petre
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Joel Friedman