Sciweavers

436 search results - page 63 / 88
» The complexity of contract negotiation
Sort
View
POPL
2003
ACM
14 years 7 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
COMPGEOM
2006
ACM
14 years 1 months ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
IPL
2007
72views more  IPL 2007»
13 years 7 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
KBSE
1995
IEEE
13 years 11 months ago
A Model for Decision Maintenance in the WinWin Collaboration Framework
Cost-effective engineering and evolution of complex software must involve the different stakeholders concurrently and collaboratively. The hard problem is providing computer suppo...
Prasanta K. Bose
DAGSTUHL
2007
13 years 8 months ago
07431 Executive Summary - Computational Issues in Social Choice
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...
Ulle Endriss, Jérôme Lang, Francesca ...