923 search results - page 113 / 185 » On a generalization of Stickelberger's Theorem |
TACAS
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
COMPGEOM
1993
ACM
15 years 4 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
115
click to vote
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
108
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
ESOP
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We show how a program analysis technique originally developed for C-like pointer structures can be adapted to analyse the hierarchical structure of processes in the ambie...