11565 search results - page 2252 / 2313 » Computing Minimal Mappings |
ADHOCNOW
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
The design of cryptographic hash functions is a very complex and failure-prone process. For this reason, this paper puts forward a completely modular and fault-tolerant approach to...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We investigate and model the dynamics of two-dimensional stochastic self-assembly of intelligent micro-systems with minimal requirements in terms of sensing, actuation, and contro...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Metamorphic testing has been shown to be a simple yet effective technique in addressing the quality assurance of applications that do not have test oracles, i.e., for which it is ...