Sciweavers

5363 search results - page 1038 / 1073
» Building the Cerebellum in a Computer
Sort
View
161
Voted
POPL
1994
ACM
15 years 10 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
PODS
1989
ACM
129views Database» more  PODS 1989»
15 years 10 months ago
The Alternating Fixpoint of Logic Programs with Negation
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
Allen Van Gelder
POPL
1989
ACM
15 years 10 months ago
How to Make ad-hoc Polymorphism Less ad-hoc
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...
Philip Wadler, Stephen Blott
160
Voted
BIBE
2007
IEEE
167views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
Assessing the Performance of Macromolecular Sequence Classifiers
Machine learning approaches offer some of the most cost-effective approaches to building predictive models (e.g., classifiers) in a broad range of applications in computational bio...
Cornelia Caragea, Jivko Sinapov, Vasant Honavar, D...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
« Prev « First page 1038 / 1073 Last » Next »