406 search results - page 69 / 82 » Pseudorandomness and Combinatorial Constructions |
ANTSW
2004
Springer
14 years 3 months ago
2004
Springer
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
FSE
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we study the minimum distance between the set of bent functions and the set of 1-resilient Boolean functions and present a lower bound on that. The bound is proved to...
MOZ
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
AI
2003
Springer
14 years 3 months ago
2003
Springer
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
FMCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Formal methods, in particular model checking, are increasingly accepted as integral part of system development. With large software systems beyond the range of fully auto...