Sciweavers

3775 search results - page 20 / 755
» The Expression Problem Revisited
Sort
View
SACRYPT
2001
Springer
110views Cryptology» more  SACRYPT 2001»
13 years 12 months ago
Random Walks Revisited: Extensions of Pollard's Rho Algorithm for Computing Multiple Discrete Logarithms
This paper extends the analysis of Pollard’s rho algorithm for solving a single instance of the discrete logarithm problem in a finite cyclic group G to the case of solving more...
Fabian Kuhn, René Struik
ATAL
2006
Springer
13 years 11 months ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin
WOLLIC
2010
Springer
14 years 14 days ago
The Two-Variable Fragment with Counting Revisited
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...
Ian Pratt-Hartmann
RECOMB
2005
Springer
14 years 7 months ago
Consensus Folding of Unaligned RNA Sequences Revisited
As one of the earliest problems in computational biology, RNA secondary structure prediction (sometimes referred to as "RNA folding") problem has attracted attention agai...
Vineet Bafna, Haixu Tang, Shaojie Zhang
CEC
2010
IEEE
12 years 11 months ago
Revisiting Evolutionary Information Filtering
— Adaptive Information Filtering seeks a solution to the problem of information overload through a tailored representation of the user’s interests, called user profile, which ...
Nikolaos Nanas, Stefanos Kodovas, Manolis Vavalis