Sciweavers

1615 search results - page 286 / 323
» Computer science and decision theory
Sort
View
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
CANDC
2011
ACM
12 years 9 months ago
Understanding exploratory creativity in a visual domain
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...
POPL
2003
ACM
14 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SIGMOD
2006
ACM
208views Database» more  SIGMOD 2006»
14 years 9 months ago
Data management for a smart earth: the Swiss NCCR-MICS initiative
The Swiss National Competence Center for Research in mobile Information and Communication Systems (NCCR-MICS or MICS) is one of several research initiatives sponsored by the Swiss...
Karl Aberer, Gustavo Alonso, Donald Kossmann
CSCW
2010
ACM
14 years 6 months ago
Socialization tactics in wikipedia and their effects
Socialization of newcomers is critical both for conventional groups. It helps groups perform effectively and the newcomers develop commitment. However, little empirical research h...
Boreum Choi, Kira Alexander, Robert E. Kraut, John...