Sciweavers

3134 search results - page 31 / 627
» Computing full disjunctions
Sort
View
FOSSACS
2005
Springer
14 years 3 months ago
Full Abstraction for Polymorphic Pi-Calculus
traction for Polymorphic Pi-Calculus Alan Jeffrey 1,2 and Julian Rathke3 1 Bell Labs, Lucent Technologies, Chicago, IL, USA 2 DePaul University, Chicago, IL, USA 3 University of Su...
Alan Jeffrey, Julian Rathke
LICS
1997
IEEE
14 years 2 months ago
Full Abstraction for Functional Languages with Control
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
James Laird
IJISEC
2006
108views more  IJISEC 2006»
13 years 10 months ago
How to obtain full privacy in auctions
Abstract Privacy has become a factor of increasing importance in auction design. We propose general techniques for cryptographic first-price and (M + 1)st-price auction protocols t...
Felix Brandt
WAOA
2007
Springer
106views Algorithms» more  WAOA 2007»
14 years 4 months ago
Full and Local Information in Distributed Decision Making
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
Panagiota N. Panagopoulou, Paul G. Spirakis
GI
2004
Springer
14 years 3 months ago
Towards Using the Full Human Potential in Games and Virtual Environments
: Humans have complex sensory and control capabilities. Only a few are used in standard games and virtual environments. Examples of games using interfaces beyond mouse, keyboard an...
Steffi Beckhaus