3628 search results - page 163 / 726 » The Decision Diffie-Hellman Problem |
103
Voted
FOCS
1993
IEEE
15 years 7 months ago
1993
IEEE
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
130
click to vote
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
131
Voted
AAAI
1996
15 years 4 months ago
1996
Previous work suggests that reminding a conversational partner of mutually known information depends on the conversants' attentional state, their resource limits and the reso...
146
Voted
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Surprisingly, console logs rarely help operators detect problems in large-scale datacenter services, for they often consist of the voluminous intermixing of messages from many sof...
121
Voted
CCE
2004
15 years 3 months ago
2004
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...