1615 search results - page 197 / 323 » Computer science and decision theory |
186
click to vote
ICALP
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
179
click to vote
RELMICS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. As part of a larger project, we have built a declarative assembly language that enables us to specify multiple code paths to compute particular quantities, giving the ins...
154
click to vote
SIGECOM
2003
ACM
16 years 4 days ago
2003
ACM
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
177
click to vote
CHI
1995
ACM
15 years 10 months ago
1995
ACM
We describe “Belvedere,” a system to support students engaged in critical discussion of science and public policy issues. The design is intended to address cognitive and metac...
194
click to vote
ENTCS
2007
15 years 6 months ago
2007
syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...