11151 search results - page 390 / 2231 » On the Complexity of Model Expansion |
200
click to vote
CRYPTO
2006
Springer
15 years 11 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
166
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
235
click to vote
ISSTA
1998
ACM
15 years 11 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
189
click to vote
WSC
2001
15 years 9 months ago
2001
Congestion control algorithms, such as TCP or the closelyrelated additive increase-multiplicative decrease algorithms, are extremely difficult to simulate on a large scale. The re...
171
click to vote
CG
2010
Springer
15 years 7 months ago
2010
Springer
Interacting populations exhibit complex behavior in nature. Classic quadratic iteration models with two or three populations exhibit some of the features seen in nature, but fail ...