Sciweavers

1096 search results - page 18 / 220
» Computation Slicing: Techniques and Theory
Sort
View
AAAI
2006
13 years 9 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski
ACL
2011
12 years 11 months ago
Integrating surprisal and uncertain-input models in online sentence comprehension: formal techniques and empirical results
A system making optimal use of available information in incremental language comprehension might be expected to use linguistic knowledge together with current input to revise beli...
Roger Levy
GC
2004
Springer
14 years 1 months ago
The KGP Model of Agency for Global Computing: Computational Model and Prototype Implementation
Abstract. We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is ...
Andrea Bracciali, Neophytos Demetriou, Ulrich Endr...
SIAMNUM
2010
123views more  SIAMNUM 2010»
13 years 2 months ago
Critical Analysis of the Spanning Tree Techniques
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
Pawel Dlotko, Ruben Specogna
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 7 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao