635 search results - page 23 / 127 » Some Computational Problems Related to Pseudo-intents |
173
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
156
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
139
click to vote
UC
2009
Springer
16 years 18 days ago
2009
Springer
In this note we investigate the problem of computing the domain of attraction of a flow on R2 for a given attractor. We consider an operator that takes two inputs, the description...
177
click to vote
TCS
2010
15 years 4 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
200
click to vote
EBERNBURG
1990
15 years 10 months ago
1990
In the theory of living systems any description of self-organizing processes is confronted by a very central problem concerning the role of the system's boundary, i.e., there...