1485 search results - page 134 / 297 » connection 2010 |
162
Voted
SIAMDM
2010
15 years 4 months ago
2010
Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
134
click to vote
SIAMSC
2010
15 years 4 months ago
2010
The IDR method of Sonneveld and van Gijzen [SIAM J. Sci. Comput., 31:1035–1062, 2008] is shown to be a Petrov-Galerkin (projection) method with a particular choice of left Krylov...
145
click to vote
SLOGICA
2010
15 years 4 months ago
2010
Abstract. Representing an epistemic situation involving several agents obviously depends on the modeling point of view one takes. We start by identifying the types of modeling poin...
169
click to vote
SYNTHESE
2010
15 years 4 months ago
2010
In this paper, I investigate the relationship between preference and judgment aggregation, using the notion of ranking judgment introduced in List and Pettit (Synthese 140(1–2):2...
172
click to vote
TON
2010
15 years 4 months ago
2010
—We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarante...