Sciweavers

346 search results - page 40 / 70
» Logical omniscience as a computational complexity problem
Sort
View
POPL
2008
ACM
14 years 8 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
GEOINFORMATICA
1998
125views more  GEOINFORMATICA 1998»
13 years 7 months ago
Computational Perspectives on Map Generalization
ally related entity types, or classes, into higher level, more abstract types, as part of a hierarchical classi®cation scheme. graphy, generalization retains the notion of abstrac...
Robert Weibel, Christopher B. Jones
CONTEXT
2003
Springer
14 years 26 days ago
A SAT-Based Algorithm for Context Matching
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
Paolo Bouquet, Bernardo Magnini, Luciano Serafini,...
ACL
2010
13 years 5 months ago
Towards Relational POMDPs for Adaptive Dialogue Management
Open-ended spoken interactions are typically characterised by both structural complexity and high levels of uncertainty, making dialogue management in such settings a particularly...
Pierre Lison
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
An EM Algorithm on BDDs with Order Encoding for Logic-based Probabilistic Models
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
Masakazu Ishihata, Yoshitaka Kameya, Taisuke Sato,...