Sciweavers

17770 search results - page 64 / 3554
» A Generalization of Forward-Backward Algorithm
Sort
View
IPL
2006
101views more  IPL 2006»
14 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»
15 years 4 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
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
14 years 17 days ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
TABLEAUX
2007
Springer
15 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
TSMC
2002
102views more  TSMC 2002»
14 years 9 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen