Sciweavers

3625 search results - page 643 / 725
» On choosing
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 10 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
MM
1994
ACM
90views Multimedia» more  MM 1994»
15 years 10 months ago
Scheduling Policies for an On-Demand Video Server with Batching
In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a...
Asit Dan, Dinkar Sitaram, Perwez Shahabuddin
273
Voted
SIGAL
1990
273views Algorithms» more  SIGAL 1990»
15 years 10 months ago
Randomized Broadcast in Networks
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
Uriel Feige, David Peleg, Prabhakar Raghavan, Eli ...
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
15 years 10 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
ACMICEC
2007
ACM
115views ECommerce» more  ACMICEC 2007»
15 years 10 months ago
An economic model of portal competition under privacy concerns
Due to inherent privacy concerns, online personalization services such as those offered through toolbars and desktop widgets are characterized by "no-free-disposal" (NFD...
Ramnath K. Chellappa, Raymond G. Sin