Sciweavers

14774 search results - page 146 / 2955
» Computational complexity and evolutionary computation
Sort
View
IACR
2011
127views more  IACR 2011»
14 years 4 months ago
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
ISMB
1998
15 years 5 months ago
Phylogenetic Inference in Protein Superfamilies: Analysis of SH2 Domains
This workfocuses on the inference of evolutionary relationships in protein superfamilies, and the uses of these relationships to identify keypositions in the structure, to infer a...
Kimmen Sjölander
CISIS
2011
IEEE
14 years 4 months ago
Agent-based Pickup and Delivery Planning: The Learnable Evolution Model Approach
—The Dynamic Vehicle Routing Problem (DVRP) is an optimization problem in which agents deliver orders that are not known in advance to the routing. Partial solutions need to be a...
Janusz Wojtusiak, Tobias Warden, Otthein Herzog
CCGRID
2004
IEEE
15 years 8 months ago
Evolutionary molecular structure determination using Grid-enabled data mining
A new computational framework is developed for the evolutionary determination of molecular crystal structures using the Shake-and-Bake methodology. Genetic algorithms are performe...
Mark L. Green, Russ Miller
NC
2011
219views Neural Networks» more  NC 2011»
14 years 7 months ago
Complexity-preserving simulations among three variants of accepting networks of evolutionary processors
In this paper we consider three variants of accepting networks of evolutionary processors. It is known that two of them are equivalent to Turing machines. We propose here a direct ...
Paolo Bottoni, Anna Labella, Florin Manea, Victor ...