1686 search results - page 249 / 338 » Programs as polygraphs: computability and complexity |
124
click to vote
ICPPW
2005
IEEE
15 years 9 months ago
2005
IEEE
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
142
click to vote
SIGCSE
2005
ACM
15 years 9 months ago
2005
ACM
Information technology projects are growing in complexity and require teams to solve problems and develop solutions. With current undergraduate, computer science and information s...
130
Voted
EGC
2005
Springer
15 years 9 months ago
2005
Springer
We are concerned with the following problem: How do we allow a community of users to access and process diverse data stored in many different formats? Standard data formats and da...
112
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
138
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...