Sciweavers

5378 search results - page 232 / 1076
» Base Logics in Argumentation
Sort
View
JOC
2006
80views more  JOC 2006»
15 years 6 months ago
Elliptic Curves with Low Embedding Degree
Motivated by the needs of the pairing based cryptography, Miyaji, Nakabayashi and Takano have suggested a construction of so-called MNT elliptic curves with low embedding degree. ...
Florian Luca, Igor Shparlinski
QUESTA
2008
205views more  QUESTA 2008»
15 years 6 months ago
Continuity of the M/G/c queue
Consider an M/G/c queue with homogeneous servers and service time distribution F. It is shown that an approximation of the service time distribution F by stochastically smaller di...
Lothar Breuer
PPSN
2010
Springer
15 years 5 months ago
General Lower Bounds for the Running Time of Evolutionary Algorithms
Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
Dirk Sudholt
IJBC
2010
116views more  IJBC 2010»
15 years 4 months ago
Recurrence Plots for Symbolic Sequences
This paper introduces an extension of recurrence analysis to symbolic sequences. Heuristic arguments based on Shannon-McMillan-Breiman theorem suggest several relations between th...
Philippe Faure, Annick Lesne
TCS
2011
15 years 1 months ago
Computational processes, observers and Turing incompleteness
We propose a formal definition of Wolfram’s notion of computational process based on iterated transducers together with a weak observer, a model of computation that captures so...
Klaus Sutner