Sciweavers

4555 search results - page 25 / 911
» Deductive Algorithmic Knowledge
Sort
View
FLAIRS
2007
13 years 11 months ago
Deriving Chronological Information from Texts through a Graph-Based Algorithm
We propose a method of deriving chronological order of events in natural language texts by constraining temporal boundaries associated to events and projecting them on a timeline....
Cosmin Adrian Bejan
POPL
1998
ACM
14 years 1 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
AAAI
1996
13 years 10 months ago
A Connectionist Framework for Reasoning: Reasoning with Examples
We present a connectionist architecture that supports almost instantaneous deductive and abductive reasoning. The deduction algorithm responds in few steps for single rule queries...
Dan Roth
AISB
1997
Springer
14 years 1 months ago
Modelling Bounded Rationality Using Evolutionary Techniques
A technique for the credible modelling of economic agents with bounded rationality based on the evolutionary techniques is described. The genetic programming paradigm is most suite...
Bruce Edmonds, Scott Moss
CINQ
2004
Springer
125views Database» more  CINQ 2004»
14 years 2 months ago
Deducing Bounds on the Support of Itemsets
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
Toon Calders