Sciweavers

3406 search results - page 182 / 682
» Computational models of classical conditioning
Sort
View
DSN
2000
IEEE
15 years 11 months ago
Whither Generic Recovery from Application Faults? A Fault Study using Open-Source Software
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...
Subhachandra Chandra, Peter M. Chen
ICALP
2009
Springer
16 years 7 months ago
When Are Timed Automata Determinizable?
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...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...
191
Voted
SCCC
1997
IEEE
15 years 11 months ago
Reactive Ranking for Cooperative Databases
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...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis
SCW
2012
IEEE
14 years 2 months ago
Index-number tests and the common-scaling social cost-of-living index
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 ...
David I. Donaldson, Krishna Pendakur
161
Voted
ICDCS
2009
IEEE
16 years 4 months ago
The Impact of Communication Models on Routing-Algorithm Convergence
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...
Aaron D. Jaggard, Vijay Ramachandran, Rebecca N. W...