Sciweavers

3360 search results - page 405 / 672
» An Optimal Distributed Edge-Biconnectivity Algorithm
Sort
View
ATAL
2011
Springer
14 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
ATAL
2006
Springer
15 years 10 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
200
Voted
IJON
2002
85views more  IJON 2002»
15 years 6 months ago
Learning statistically efficient features for speaker recognition
We apply independent component analysis (ICA) for extracting an optimal basis to the problem of finding efficient features for a speaker. The basis functions learned by the algori...
Gil-Jin Jang, Te-Won Lee, Yung-Hwan Oh
INFOCOM
2010
IEEE
15 years 5 months ago
Value-aware Resource Allocation for Service Guarantees in Networks
—The traditional formulation of the total value of information transfer is a multi-commodity flow problem. Here, each data source is seen as generating a commodity along a fixe...
Parimal Parag, Srinivas Shakkottai, Jean-Fran&cced...
IPPS
2010
IEEE
15 years 4 months ago
Executing task graphs using work-stealing
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
Kunal Agrawal, Charles E. Leiserson, Jim Sukha