Sciweavers

1712 search results - page 312 / 343
» A Computational Approach to Binding Theory
Sort
View
POPL
2006
ACM
16 years 1 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 1 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
CVPR
2010
IEEE
15 years 10 months ago
Scalable Active Matching
In matching tasks in computer vision, and particularly in real-time tracking from video, there are generally strong priors available on absolute and relative correspondence locati...
Ankur Handa, Margarita Chli, Hauke Strasdat, Andre...
PRDC
2009
IEEE
15 years 8 months ago
Quantifying Criticality of Dependability-Related IT Organization Processes in CobiT
—With ever-growing complexity of computer and communication systems analytical methods do not scale, especially with respect to dependability assessment of information technology...
Tobias Goldschmidt, Andreas Dittrich, Miroslaw Mal...
ATAL
2009
Springer
15 years 8 months ago
Bounded rationality via recursion
Current trends in model construction in the field of agentbased computational economics base behavior of agents on either game theoretic procedures (e.g. belief learning, fictit...
Maciej Latek, Robert L. Axtell, Bogumil Kaminski