Sciweavers

922 search results - page 115 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
COMPGEOM
1993
ACM
14 years 1 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
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 ...
Marshall W. Bern, David Eppstein
ATAL
2006
Springer
14 years 24 days ago
Symbolic negotiation revisited
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...
Peep Küngas, Mihhail Matskin
COLT
2006
Springer
14 years 24 days ago
Online Learning Meets Optimization in the Dual
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...
Shai Shalev-Shwartz, Yoram Singer
ESOP
2000
Springer
14 years 20 days ago
A Kleene Analysis of Mobile Ambients
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...
Flemming Nielson, Hanne Riis Nielson, Shmuel Sagiv
MPC
1995
Springer
116views Mathematics» more  MPC 1995»
14 years 18 days ago
Computer-Aided Computing
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...
Natarajan Shankar