Sciweavers

9842 search results - page 124 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
IJAR
2008
108views more  IJAR 2008»
13 years 10 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 10 months ago
Alternative axiomatics and complexity of deliberative STIT theories
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
Philippe Balbiani, Andreas Herzig, Nicolas Troquar...
DAM
2002
125views more  DAM 2002»
13 years 10 months ago
Complexity of Langton's ant
The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate a...
Anahí Gajardo, Andrés Moreira, Eric ...
ECCC
2002
103views more  ECCC 2002»
13 years 10 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
WAIM
2010
Springer
13 years 8 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le