1358 search results - page 222 / 272 » Proceedings |
84
Voted
FOCS
1992
IEEE
15 years 4 months ago
1992
IEEE
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
92
Voted
ICLP
1992
Springer
15 years 4 months ago
1992
Springer
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
137
Voted
STACS
1993
Springer
15 years 4 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
191
click to vote
STOC
1993
ACM
15 years 4 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
150
click to vote
STOC
1994
ACM
15 years 4 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...