3131 search results - page 250 / 627 » Generalized connection caching |
141
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
The goal of this paper is to define the n-connected regions in the Cartesian workspace of fully-parallel manipulators, i.e. the maximal regions where it is possible to execute po...
142
Voted
JCT
2006
15 years 6 months ago
2006
Difference Systems of Sets (DSS) are combinatorial configurations that arise in connection with code synchronization. This paper gives new constructions of DSS obtained from parti...
159
click to vote
ENTCS
2007
15 years 6 months ago
2007
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
167
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
172
click to vote
JC
2007
15 years 6 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...