4894 search results - page 306 / 979 » Choices |
166
click to vote
DNA
2004
Springer
16 years 24 days ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
174
click to vote
EDBTW
2004
Springer
16 years 24 days ago
2004
Springer
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model t...
173
click to vote
ERCIMDL
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. A policy is a statement that an action is permitted or forbidden if certain conditions hold. We introduce a language for reasoning about policies called Rosetta. What mak...
172
click to vote
FSTTCS
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. Conventional semantics for shared-variable concurrency suffers from the “grain of time” problem, i.e., the necessity of specifying a default level of atomicity. We pr...
141
click to vote
GECCO
2004
Springer
16 years 24 days ago
2004
Springer
Abstract. Choosing representations and operators that preserve locality between genotype and phenotype space is an important goal in EA design. In the GA literature there has been ...