Sciweavers

7504 search results - page 160 / 1501
» Computing with Action Potentials
Sort
View
SIGECOM
2010
ACM
184views ECommerce» more  SIGECOM 2010»
14 years 28 days ago
Computing pure strategy nash equilibria in compact symmetric games
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
Christopher Thomas Ryan, Albert Xin Jiang, Kevin L...
AIPS
2009
13 years 9 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
FLAIRS
2004
13 years 9 months ago
An Active Architecture for Managing Events in Pervasive Computing Environments
Many dramatizations have depicted a fully automated home living environment, where actions and events are understood or even anticipated. While the realization of such environment...
Edwin Wong, Lisa J. Burnell, Charles Hannon
NN
2002
Springer
105views Neural Networks» more  NN 2002»
13 years 7 months ago
The computational role of dopamine D1 receptors in working memory
The prefrontal cortex (PFC) is essential for working memory, which is the ability to transiently hold and manipulate information necessary for generating forthcoming action. PFC n...
Daniel Durstewitz, Jeremy K. Seamans
SRDS
2003
IEEE
14 years 1 months ago
Coordinated Forward Error Recovery for Composite Web Services
This paper proposes a solution based on forward error recovery, oriented towards providing dependability of composite Web services. While exploiting their possible support for fau...
Ferda Tartanoglu, Valérie Issarny, Alexande...