Sciweavers

26354 search results - page 4957 / 5271
» How we refactor, and how we know it
Sort
View
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 10 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
KR
2000
Springer
15 years 10 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
PPSN
2000
Springer
15 years 10 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 10 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...
SIGLEX
1991
15 years 10 months ago
Presuppositions and Default Reasoning: A Study in Lexical Pragmatics
Explaining how the meaning of words relate to the meaning of the utterance in which they are used is of utmost importance. The most common approaches view the meaning of an uttera...
Robert E. Mercer
« Prev « First page 4957 / 5271 Last » Next »