Sciweavers

1003 search results - page 28 / 201
» Proposal of Generalized Rule Programming Model
Sort
View
SIGIR
2008
ACM
13 years 9 months ago
Learning to rank at query-time using association rules
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
Adriano Veloso, Humberto Mossri de Almeida, Marcos...
SIGSOFT
2003
ACM
14 years 10 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
COCO
2005
Springer
72views Algorithms» more  COCO 2005»
14 years 2 months ago
Toward a Model for Backtracking and Dynamic Programming
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
14 years 1 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
ATAL
2004
Springer
14 years 2 months ago
A Complete and Decidable Logic for Resource-Bounded Agents
We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The seman...
Natasha Alechina, Brian Logan, Mark Whitsey