1243 search results - page 54 / 249 » Complexity reduction of C-Algorithm |
139
click to vote
EC
2008
15 years 26 days ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
109
click to vote
JAPLL
2010
14 years 11 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
104
click to vote
LPAR
2010
Springer
14 years 11 months ago
2010
Springer
We consider two-player zero-sum games on graphs. On the basis of the information available to the players these games can be classified as follows: (a) partial-observation (both p...
IWSEC
2009
Springer
15 years 7 months ago
2009
Springer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of ...
127
click to vote
LPAR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...