Sciweavers

5090 search results - page 450 / 1018
» Constructing Strategies for Programming
Sort
View
FINTAL
2006
15 years 10 months ago
Coordination Structures in a Typed Feature Structure Grammar: Formalization and Implementation
Abstract. Every language employs its own coordination strategies, according to the type of coordinating marking, the pattern of marking, the position of the marker, and the phrase ...
Jong-Bok Kim, Jaehyung Yang
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 7 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
16 years 7 months ago
The Santa Claus problem
The Santa Claus problem is an interesting exercise in concurrent programming which has been used in a comparison of the concurrency mechanisms of Ada and Java. We present a simple...
Nikhil Bansal, Maxim Sviridenko
FLOPS
2010
Springer
16 years 1 months ago
A Pearl on SAT Solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Jacob M. Howe, Andy King
UM
2007
Springer
16 years 1 months ago
Mobile Opportunistic Planning: Methods and Models
Abstract. We present a study exploring the promise of developing computational systems to support the discovery and execution of opportunistic activities in mobile settings. We int...
Eric Horvitz, Paul Koch, Muru Subramani