Sciweavers

2082 search results - page 98 / 417
» Change Paths in Reasoning!
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
14 years 1 months ago
Incremental Processing of Vague Queries in Interactive Retrieval Systems
The application of information retrieval techniques in interactive environments requires systems capable of efficiently processing vague queries. To reach reasonable response tim...
Ulrich Pfeifer, Stefan Pennekamp
LPAR
1994
Springer
14 years 1 months ago
On Anti-Links
The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potent...
Bernard Becker, Reiner Hähnle, Anavai Ramesh,...
LICS
1991
IEEE
14 years 16 days ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
CADE
2011
Springer
12 years 9 months ago
Compression of Propositional Resolution Proofs via Partial Regularization
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivotsWithIntersection, performs partial regularization, re...
Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel ...
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
14 years 2 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar