Sciweavers

3221 search results - page 493 / 645
» Termination of Linear Programs
Sort
View
SODA
2012
ACM
297views Algorithms» more  SODA 2012»
13 years 8 months ago
Constant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
Amit Kumar
WWW
2003
ACM
16 years 7 months ago
Adaptive ranking of web pages
In this paper, we consider the possibility of altering the PageRank of web pages, from an administrator's point of view, through the modification of the PageRank equation. It...
Ah Chung Tsoi, Gianni Morini, Franco Scarselli, Ma...
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
CGO
2007
IEEE
16 years 20 days ago
Microarchitecture Sensitive Empirical Models for Compiler Optimizations
This paper proposes the use of empirical modeling techniques for building microarchitecture sensitive models for compiler optimizations. The models we build relate program perform...
Kapil Vaswani, Matthew J. Thazhuthaveetil, Y. N. S...
ATAL
2005
Springer
15 years 12 months ago
Thespian: using multi-agent fitting to craft interactive drama
There has been a growing interest in designing multi-agent based interactive dramas. A key research challenge faced in the design of these systems is to support open-ended user in...
Mei Si, Stacy Marsella, David V. Pynadath