Sciweavers

3495 search results - page 198 / 699
» On the random satisfiable process
Sort
View
175
Voted
PARLE
1991
15 years 10 months ago
FORK: A High-Level Language for PRAMs
We present a new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM). The language attempts to satisfy two p...
Torben Hagerup, Arno Schmitt, Helmut Seidl
WWW
2010
ACM
15 years 7 months ago
LINKREC: a unified framework for link recommendation with user attributes and graph structure
With the phenomenal success of networking sites (e.g., Facebook, Twitter and LinkedIn), social networks have drawn substantial attention. On online social networking sites, link r...
Zhijun Yin, Manish Gupta, Tim Weninger, Jiawei Han
152
Voted
CORR
2008
Springer
64views Education» more  CORR 2008»
15 years 7 months ago
Linearly Parameterized Bandits
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
Paat Rusmevichientong, John N. Tsitsiklis
173
Voted
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 7 months ago
A sufficient condition for voting rules to be frequently manipulable
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
Lirong Xia, Vincent Conitzer
ANOR
2004
122views more  ANOR 2004»
15 years 7 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...