Sciweavers

1453 search results - page 228 / 291
» A globally optimal algorithm for TTD-MDPs
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 7 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
ICML
2009
IEEE
15 years 8 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
ICDCS
2007
IEEE
15 years 8 months ago
LagOver: Latency Gradated Overlays
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
Anwitaman Datta, Ion Stoica, Michael J. Franklin
ATAL
2007
Springer
15 years 7 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
INFOCOM
2000
IEEE
15 years 6 months ago
Layered Multicast Recovery
We study the problem of localizing repair packets when packets are lost. When repair packets are multicasted, a highly lossy receiver may swamp the entire multicast “group” wi...
Injong Rhee, Srinath R. Joshi, Minsuk Lee, S. Muth...