607 search results - page 83 / 122 » Unifying Exact Completions |
CASC
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
ER
2005
Springer
15 years 4 months ago
2005
Springer
To achieve the dream of the semantic web, it must be possible for ordinary users to invoke services. Exactly how to turn this dream into reality is a challenging opportunity and a...
GBRPR
2005
Springer
15 years 4 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
81
Voted
SC
2004
ACM
15 years 4 months ago
2004
ACM
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...