Sciweavers

2841 search results - page 41 / 569
» A Call to Order
Sort
View
JELIA
2010
Springer
14 years 8 months ago
Retroactive Subsumption-Based Tabled Evaluation of Logic Programs
Abstract. Tabled evaluation is a recognized and powerful implementation technique that overcomes some limitations of traditional Prolog systems in dealing with recursion and redund...
Flávio Cruz, Ricardo Rocha
WISA
2004
Springer
15 years 3 months ago
A Probabilistic Method for Detecting Anomalous Program Behavior
In this paper, we, as well as Eskin, Lee, Stolfo [7] propose a method of prediction model. In their method, the program was characterized with both the order and the kind of system...
Kohei Tatara, Toshihiro Tabata, Kouichi Sakurai
CLASSIFICATION
2006
103views more  CLASSIFICATION 2006»
14 years 9 months ago
On the Complexity of Ordinal Clustering
Abstract. Given a set of pairwise distances on a set of n points, constructing an edge-weighted tree whose leaves are these n points such that the tree distances would mimic the or...
Rahul Shah, Martin Farach-Colton
CADE
1994
Springer
15 years 1 months ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
RTA
1993
Springer
15 years 1 months ago
Total Termination of Term Rewriting
Usually termination of term rewriting systems TRS's is proved by means of a monotonic well-founded order. If this order is total on ground terms, the TRS is called totally ...
Maria C. F. Ferreira, Hans Zantema