Sciweavers

1458 search results - page 122 / 292
» Monads for incremental computing
Sort
View
116
Voted
FLAIRS
2004
15 years 4 months ago
Structure Discovery from Sequential Data
In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discov...
Jeffrey Coble, Diane J. Cook, Lawrence B. Holder, ...
127
Voted
AAAI
1990
15 years 4 months ago
Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction
This paper presents a projection algorithm for incremental control rule synthesis. The algorithm synthesizes an initial set of goal-achieving control rules using a combination of ...
Mark Drummond, John L. Bresina
AAMAS
2007
Springer
15 years 3 months ago
Shaping multi-agent systems with gradient reinforcement learning
An original Reinforcement Learning (RL) methodology is proposed for the design of multi-agent systems. In the realistic setting of situated agents with local perception, the task o...
Olivier Buffet, Alain Dutech, François Char...
LRE
2008
100views more  LRE 2008»
15 years 3 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
TCAD
2008
112views more  TCAD 2008»
15 years 3 months ago
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
Yu Hu, Victor Shih, Rupak Majumdar, Lei He