5964 search results - page 390 / 1193 » A theory of speculative computation |
195
click to vote
COLT
2003
Springer
16 years 24 days ago
2003
Springer
Abstract. In this paper we initiate an exploration of relationships between “preference elicitation”, a learning-style problem that arises in combinatorial auctions, and the pr...
190
click to vote
IPPS
2002
IEEE
16 years 15 days ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
279
Voted
COLT
2001
Springer
16 years 2 days ago
2001
Springer
We prove strong noise-tolerance properties of a potential-based boosting algorithm, similar to MadaBoost (Domingo and Watanabe, 2000) and SmoothBoost (Servedio, 2003). Our analysi...
216
click to vote
CONCUR
2000
Springer
15 years 12 months ago
2000
Springer
This paper introduces process spaces, a unified theory of interacting systems. The trait, abstract executions, leads to a simple and general set formalism. For concurrent systems ...
189
Voted
CHI
1999
ACM
15 years 12 months ago
1999
ACM
Inspired by Hill and Hollan’s original work [6], we have been developing a theory of interaction history and building tools to apply this theory to navigation in a complex infor...