Sciweavers

3305 search results - page 167 / 661
» Can we Rely on SQL
Sort
View
IFIP
2000
Springer
14 years 2 months ago
Broadway: A Software Architecture for Scientific Computing
Scientific programs rely heavily on software libraries. This paper describes the limitations of this reliance and shows how it degrades software quality. We offer a solution that u...
Samuel Z. Guyer, Calvin Lin
ANTS
2010
Springer
216views Algorithms» more  ANTS 2010»
14 years 1 months ago
Efficient Pairing Computation with Theta Functions
In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's alg...
David Lubicz, Damien Robert
CCS
2008
ACM
14 years 12 days ago
Using rhythmic nonces for puzzle-based DoS resistance
To protect against replay attacks, many Internet protocols rely on nonces to guarantee freshness. In practice, the server generates these nonces during the initial handshake, but ...
Ellick Chan, Carl A. Gunter, Sonia Jahid, Evgeni P...
CP
2008
Springer
14 years 5 days ago
Approximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Pe...
ECAI
2008
Springer
14 years 5 days ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo