Sciweavers

5964 search results - page 880 / 1193
» A theory of speculative computation
Sort
View
CSCW
2010
ACM
15 years 12 months ago
Sending mixed signals: multilevel reputation effects in peer-to-peer lending markets
Online peer-to-peer (P2P) lending organizations enable an individual to obtain an unsecured loan from a collection of individuals without the participation of a bank. Previous res...
Benjamin C. Collier, Robert Hampshire
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 11 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
15 years 11 months ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
COLT
1999
Springer
15 years 11 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
196
Voted
WADT
1999
Springer
15 years 11 months ago
From States to Histories
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...
Manfred Broy