Sciweavers

9405 search results - page 256 / 1881
» Computing a Model of Set Theory
Sort
View
FUIN
2002
100views more  FUIN 2002»
15 years 4 months ago
UPSILON: Universal Programming System with Incomplete Lazy Object Notation
This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control, has no named variables and has an object-oriented flavo...
Brian Postow, Kenneth W. Regan, Carl H. Smith
TCC
2007
Springer
112views Cryptology» more  TCC 2007»
15 years 10 months ago
On the Necessity of Rewinding in Secure Multiparty Computation
We investigate whether security of multiparty computation in the information-theoretic setting implies their security under concurrent composition. We show that security in the sta...
Michael Backes, Jörn Müller-Quade, Domin...
SIGIR
2002
ACM
15 years 4 months ago
Risk minimization and language modeling in text retrieval dissertation abstract
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
ChengXiang Zhai
BIRTHDAY
2000
Springer
15 years 8 months ago
Discrete time process algebra with silent step
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
Jos C. M. Baeten, Jan A. Bergstra, Michel A. Renie...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 10 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman