Sciweavers

17760 search results - page 42 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
IPL
2006
101views more  IPL 2006»
13 years 9 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz
SSDBM
2008
IEEE
95views Database» more  SSDBM 2008»
14 years 3 months ago
Finding Frequent Items over General Update Streams
Abstract. We present novel space and time-efficient algorithms for finding frequent items over general update streams. Our algorithms are based on a novel adaptation of the popula...
Sumit Ganguly, Abhayendra N. Singh, Satyam Shankar
TABLEAUX
2007
Springer
14 years 3 months ago
Axiom Pinpointing in General Tableaux
Axiom pinpointing has been introduced in description logics (DLs) to help the user to understand the reasons why consequences hold and to remove unwanted consequences by computing ...
Franz Baader, Rafael Peñaloza
NIPS
1998
13 years 10 months ago
Gradient Descent for General Reinforcement Learning
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
Leemon C. Baird III, Andrew W. Moore
STOC
2002
ACM
93views Algorithms» more  STOC 2002»
14 years 9 months ago
Competitive generalized auctions
Amos Fiat, Andrew V. Goldberg, Jason D. Hartline, ...