561 search results - page 65 / 113 » Inferring better contracts |
COMPGEOM
2003
ACM
14 years 28 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SPAA
1997
ACM
13 years 12 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
ACMICEC
2007
ACM
13 years 11 months ago
2007
ACM
We investigate two challenges advance of e-commerce creates for traditional practice of travel distribution. First, we explore whether travel providers benefit from strategically ...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
Most real-world negotiation scenarios involve multiple, interdependent issues. These scenarios are specially challenging because the agents' utility functions are nonlinear, ...
CODES
2004
IEEE
13 years 11 months ago
2004
IEEE
Register bypassing is a powerful and widely used feature in modern processors to eliminate certain data hazards. Although complete bypassing is ideal for performance, bypassing ha...