7274 search results - page 83 / 1455 » Abstractions for network update |
91
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. This paper presents a theoretical study of the selection pressure in asynchronous cellular evolutionary algorithms (cEAs). This work is motivated by the search for a gene...
110
click to vote
ECSQARU
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. Finding optimal policies for general partially observable Markov decision processes (POMDPs) is computationally difficult primarily due to the need to perform dynamic-pr...
105
click to vote
EDBTW
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. While XQuery is becoming a standard, the W3C is currently discussing the features of an update language for XML, and its requirements. Therefore, time is ripe for designi...
86
Voted
ICPP
1987
IEEE
15 years 4 months ago
1987
IEEE
Abstract. We address the problem of designing and building efficient custom Vl.Sl-besed processors to do computations on large multi-dimensional lattices. The design tradeoffs for ...
134
Voted
NETWORKING
2004
15 years 2 months ago
2004
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...