Sciweavers

4743 search results - page 36 / 949
» The PlusCal Algorithm Language
Sort
View
ESOP
2009
Springer
14 years 1 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
APL
1993
ACM
14 years 2 months ago
Identification of Parallelism in Neural Networks by Simulation with Language J.
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
Alexei N. Skurikhin, Alvin J. Surkan
ICLP
1999
Springer
14 years 2 months ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
EC
2008
102views ECommerce» more  EC 2008»
13 years 10 months ago
Genetic Algorithms for Data-Driven Web Question Answering
We present1 an evolutionary approach for the computation of exact answers to Natural Languages (NL) questions. Answers are extracted directly from the N
Alejandro Figueroa, Günter Neumann
ICALP
2000
Springer
14 years 1 months ago
Average Bit-Complexity of Euclidean Algorithms
Abstract. We obtain new results regarding the precise average bitcomplexity of five algorithms of a broad Euclidean type. We develop a general framework for analysis of algorithms,...
Ali Akhavi, Brigitte Vallée