Sciweavers

3446 search results - page 316 / 690
» A Reasoning Algorithm for pD*
Sort
View
148
Voted
SCP
2008
115views more  SCP 2008»
15 years 6 months ago
Goto elimination in program algebra
This paper shows that program algebra (PGA) [8] offers a mathematical and systematic framework for reasoning about correctness and equivalence of algorithms and transformation rul...
Thuy Duong Vu
JETAI
2007
111views more  JETAI 2007»
15 years 6 months ago
Contextual vocabulary acquisition as computational philosophy and as philosophical computation
Contextual vocabulary acquisition (CVA) is the active, deliberate acquisition of a meaning for an unknown word in a text by reasoning from textual clues, prior knowledge, and hypo...
William J. Rapaport, Michael W. Kibby
TROB
2008
113views more  TROB 2008»
15 years 6 months ago
Occam's Razor Applied to Network Topology Inference
We present a method for inferring the topology of a sensor network given nondiscriminating observations of activity in the monitored region. This is accomplished based on no prior ...
Dimitri Marinakis, Gregory Dudek
CORR
2000
Springer
81views Education» more  CORR 2000»
15 years 6 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
SAC
2002
ACM
15 years 6 months ago
Soft constraint propagation and solving in CHRs
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
Stefano Bistarelli, Thom W. Frühwirth, Michae...