Sciweavers

3775 search results - page 58 / 755
» The Expression Problem Revisited
Sort
View
102
Voted
SIGECOM
2006
ACM
138views ECommerce» more  SIGECOM 2006»
15 years 6 months ago
Bid expressiveness and clearing algorithms in multiattribute double auctions
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting c...
Yagil Engel, Michael P. Wellman, Kevin M. Lochner
FMCO
2005
Springer
15 years 6 months ago
Separation Results Via Leader Election Problems
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
Maria Grazia Vigliotti, Iain Phillips, Catuscia Pa...
ACL
2007
15 years 2 months ago
Sentence generation as a planning problem
In this paper, we translate sentence generation from TAG grammars with semantic and pragmatic information into a planning problem by encoding the contribution of each word declara...
Alexander Koller, Matthew Stone
106
Voted
CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
15 years 7 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...
116
Voted
EUROCRYPT
2004
Springer
15 years 6 months ago
On the Hardness of Information-Theoretic Multiparty Computation
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
Yuval Ishai, Eyal Kushilevitz