9842 search results - page 124 / 1969 » The Complexity of the Matching-Cut Problem |
123
click to vote
IJAR
2008
15 years 3 months ago
2008
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...
106
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
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...
106
Voted
DAM
2002
15 years 3 months ago
2002
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...
119
Voted
ECCC
2002
15 years 3 months ago
2002
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...
126
Voted
WAIM
2010
Springer
15 years 1 months ago
2010
Springer
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...