10995 search results - page 289 / 2199 » Positioning |
165
click to vote
EJC
2010
15 years 7 months ago
2010
In our previous paper, we presented the combinatorial theory for minimal isostatic pinned frameworks - Assur graphs - which arise in the analysis of mechanical linkages. In this p...
197
click to vote
AMC
2006
15 years 7 months ago
2006
A parallel algorithm based on the multidimensional minimization of the Rayleigh quotient is proposed to evaluate the leftmost eigenpairs of the generalized symmetric positive defi...
172
Voted
COMBINATORICS
2006
15 years 7 months ago
2006
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the g...
177
click to vote
DM
2006
15 years 7 months ago
2006
The pair length of a graph G is the maximum positive integer k, such that the vertex set of G can be partitioned into disjoint pairs {x, x }, such that d(x, x ) k for every x V (...
177
click to vote
DM
2006
15 years 7 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...