Sciweavers

2214 search results - page 106 / 443
» Complexity of Reasoning
Sort
View
CSL
2005
Springer
15 years 8 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
108
Voted
UAI
2004
15 years 4 months ago
On Finding Minimal w-cutset
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
Bozhena Bidyuk, Rina Dechter
CAINE
2003
15 years 4 months ago
An Issue Logic for Superscalar Microprocessors
In order to enhance the computer performance, nowadays microprocessors use Superscalar architecture. But the Superscalar architecture is unable to enhance the performance effectiv...
Feng-Jiann Shiao, Jong-Jiann Shieh
IJCAI
2003
15 years 4 months ago
The Concurrent, Continuous FLUX
FLUX belongs to the high-level programming languages for cognitive agents that have been developed in recent years. Based on the established, general action representation formali...
Yves Martins
PIMRC
2008
IEEE
15 years 9 months ago
A distributed extended information filter for Self-Localization in Sensor Networks
—In this paper the Self-Localization problem for Sensor Networks is addressed. Given a set of nodes deployed in an environment, self-localization consists of finding out the loc...
Andrea Gasparri, Federica Pascucci, Giovanni Ulivi