922 search results - page 150 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
131
click to vote
ATAL
2006
Springer
15 years 5 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...
136
click to vote
COLT
2006
Springer
15 years 5 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...
114
click to vote
ESOP
2000
Springer
15 years 5 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...
113
Voted
MPC
1995
Springer
15 years 5 months ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
138
click to vote
TABLEAUX
1995
Springer
15 years 5 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...