15485 search results - page 429 / 3097 » Computing Optimal Subsets |
180
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
174
click to vote
ICDCS
2006
IEEE
16 years 27 days ago
2006
IEEE
Earlier work has developed the underpinnings of a theory of scheduling computations having intertask dependencies—modeled via dags—for Internet-based computing. The goal of th...
200
Voted
ICNC
2005
Springer
16 years 10 days ago
2005
Springer
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
189
click to vote
ATAL
2004
Springer
16 years 7 days ago
2004
Springer
The goal of autonomic computing is to create computing systems capable of managing themselves to a far greater extent than they do today. This paper presents Unity, a decentralize...
180
click to vote
EUROCRYPT
2004
Springer
16 years 7 days ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...