3406 search results - page 182 / 682 » Computational models of classical conditioning |
139
Voted
DSN
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper tests the hypothesis that generic recovery techniques, such as process pairs, can survive most application faults without using application-specific information. We ex...
139
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
151
click to vote
SCCC
1997
IEEE
15 years 9 months ago
1997
IEEE
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
160
click to vote
SCW
2012
IEEE
14 years 17 days ago
2012
IEEE
For a change in prices, the common-scaling social cost-of-living index is the equal scaling of each individual’s expenditure level needed to restore the level of social welfare ...
126
click to vote
ICDCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...