318 search results - page 53 / 64 » Real Number Computability and Domain Theory |
INFOCOM
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract. Denial-of-Service (DoS) attacks remain a challenging problem in the Internet. In a DoS attack the attacker is attempting to make a resource unavailable to its intended le...
VIS
2007
IEEE
15 years 12 months ago
2007
IEEE
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
142
click to vote
STOC
1993
ACM
15 years 2 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 ...
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
104
click to vote
SCAI
1993
14 years 12 months ago
1993
Among the most important challenges for contemporary AI research are the development of methods for improved robustness, adaptability, and overall interactiveness of systems. Inter...