Sciweavers

18090 search results - page 270 / 3618
» Computing by Only Observing
Sort
View
JAIR
1998
81views more  JAIR 1998»
15 years 6 months ago
Computational Aspects of Reordering Plans
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan le...
Christer Bäckström
FUIN
2010
89views more  FUIN 2010»
15 years 5 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
ECCC
2011
234views ECommerce» more  ECCC 2011»
15 years 1 months ago
On the complexity of computational problems regarding distributions (a survey)
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
Oded Goldreich, Salil P. Vadhan
SIGMOD
2012
ACM
276views Database» more  SIGMOD 2012»
13 years 9 months ago
SCARAB: scaling reachability computation on large graphs
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
Ruoming Jin, Ning Ruan, Saikat Dey, Jeffrey Xu Yu
AIED
2007
Springer
16 years 21 days ago
Comparing Linguistic Features for Modeling Learning in Computer Tutoring
We compare the relative utility of different automatically computable linguistic feature sets for modeling student learning in computer dialogue tutoring. We use the PARADISE frame...
Katherine Forbes-Riley, Diane J. Litman, Amruta Pu...