Sciweavers

88 search results - page 17 / 18
» Approximate Search Engine Optimization for Directory Service
Sort
View
ATAL
2011
Springer
12 years 6 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
SIGCOMM
2010
ACM
13 years 6 months ago
Topology-aware resource allocation for data-intensive workloads
This paper proposes an architecture for optimized resource allocation in Infrastructure-as-a-Service (IaaS)-based cloud systems. Current IaaS systems are usually unaware of the ho...
Gunho Lee, Niraj Tolia, Parthasarathy Ranganathan,...
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 6 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 4 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
AAAI
2006
13 years 7 months ago
Decision Making in Uncertain Real-World Domains Using DT-Golog
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Mikhail Soutchanski, Huy Pham, John Mylopoulos