4377 search results - page 391 / 876 » Mass problems and randomness |
171
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simpliļ¬ed form of the Boolean parity problem. We show the method of...
142
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
201
click to vote
STACS
2005
Springer
16 years 10 days ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
163
click to vote
ASIACRYPT
2004
Springer
16 years 8 days ago
2004
Springer
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
164
click to vote
ECAI
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Information usually has many sources and is often incomplete and / or uncertain, this leads to many inconsistencies. Revision is the operation which consists in identifyi...