Sciweavers

3775 search results - page 94 / 755
» The Expression Problem Revisited
Sort
View
AAAI
2008
15 years 5 months ago
Expressive Banner Ad Auctions and Model-Based Online Optimization for Clearing
We present the design of a banner advertising auction which is considerably more expressive than current designs. We describe a general model of expressive ad contracts/bidding an...
Craig Boutilier, David C. Parkes, Tuomas Sandholm,...
FOSSACS
2008
Springer
15 years 5 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
ICMLA
2007
15 years 4 months ago
Improving gene expression programming performance by using differential evolution
Gene Expression Programming (GEP) is an evolutionary algorithm that incorporates both the idea of a simple, linear chromosome of fixed length used in Genetic Algorithms (GAs) and...
Qiongyun Zhang, Chi Zhou, Weimin Xiao, Peter C. Ne...
CSR
2007
Springer
15 years 9 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
130
Voted
CTRSA
2007
Springer
111views Cryptology» more  CTRSA 2007»
15 years 9 months ago
A Practical and Tightly Secure Signature Scheme Without Hash Function
In 1999, two signature schemes based on the flexible RSA problem (a.k.a. strong RSA problem) were independently introduced: the Gennaro-Halevi-Rabin (GHR) signature scheme and the...
Benoît Chevallier-Mames, Marc Joye