Sciweavers

1918 search results - page 69 / 384
» Discovering Cortical Algorithms
Sort
View
PPDP
2010
Springer
14 years 8 months ago
Dimensions in program synthesis
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
Sumit Gulwani
CRYPTO
1992
Springer
154views Cryptology» more  CRYPTO 1992»
15 years 1 months ago
Massively Parallel Computation of Discrete Logarithms
Numerous cryptosystems have been designed to be secure under the assumption that the computation of discrete logarithms is infeasible. This paper reports on an aggressive attempt ...
Daniel M. Gordon, Kevin S. McCurley
ICWS
2007
IEEE
14 years 11 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
IAT
2007
IEEE
15 years 4 months ago
CompAPO: A Complete Version of the APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels
PODC
2003
ACM
15 years 3 months ago
Automatic discovery of mutual exclusion algorithms
We present a methodology for automatic discovery of synchronization algorithms. We built a tool and used it to automatically discover hundreds of new algorithms for the well-known ...
Yoah Bar-David, Gadi Taubenfeld