Sciweavers

100 search results - page 20 / 20
» Towards a Structured Analysis of Approximate Problem Solving...
Sort
View
KI
2008
Springer
13 years 4 months ago
Can Argumentation Help AI to Understand Explanation?
ed from context by seeing an explanation inferentially, much in the same way that early expert systems saw an explanation as chaining of inferences. This approach omitted, for the ...
Doug Walton
QEST
2008
IEEE
13 years 11 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
11 years 7 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...
CORR
2004
Springer
180views Education» more  CORR 2004»
13 years 4 months ago
Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning
Social insect societies and more specifically ant colonies, are distributed systems that, in spite of the simplicity of their individuals, present a highly structured social organi...
Vitorino Ramos, Juan J. Merelo Guervós
JSS
2007
105views more  JSS 2007»
13 years 4 months ago
Composing pattern-based components and verifying correctness
Designing large software systems out of reusable components has become increasingly popular. Although liberal composition of reusable components saves time and expense, many exper...
Jing Dong, Paulo S. C. Alencar, Donald D. Cowan, S...