Sciweavers

8838 search results - page 1514 / 1768
» Generalizing Domain Theory
Sort
View
ICFP
2002
ACM
16 years 6 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
POPL
2010
ACM
16 years 4 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
SDM
2009
SIAM
129views Data Mining» more  SDM 2009»
16 years 3 months ago
Multi-topic Based Query-Oriented Summarization.
Query-oriented summarization aims at extracting an informative summary from a document collection for a given query. It is very useful to help users grasp the main information rel...
Dewei Chen, Jie Tang, Limin Yao
ACG
2009
Springer
16 years 1 months ago
Monte-Carlo Tree Search in Settlers of Catan
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
Istvan Szita, Guillaume Chaslot, Pieter Spronck
ARGMAS
2009
Springer
16 years 1 months ago
Burden of Proof in Deliberation Dialogs
The literature in argumentation and artificial intelligence has distinguished five types of burden of proof in persuasion dialogs, but there appears to have been no serious invest...
Douglas Walton
« Prev « First page 1514 / 1768 Last » Next »