Sciweavers

2930 search results - page 109 / 586
» The optimal sequence compression
Sort
View
AAMAS
2005
Springer
15 years 3 months ago
Learning to Coordinate Using Commitment Sequences in Cooperative Multi-agent Systems
We report on an investigation of the learning of coordination in cooperative multi-agent systems. Specifically, we study solutions that are applicable to independent agents i.e. ...
Spiros Kapetanakis, Daniel Kudenko, Malcolm J. A. ...
IPPS
1997
IEEE
15 years 2 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
ICIP
2009
IEEE
15 years 11 months ago
3d Scalable Lossless Compression Of Medical Images Based On Global And Local Symmetries
We recently proposed a symmetry-based scalable lossless compression method for 3D medical images using the 2D integer wavelet transform and the embedded block coder with optimized...
ICML
2007
IEEE
15 years 10 months ago
A novel orthogonal NMF-based belief compression for POMDPs
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...
ICCD
2004
IEEE
96views Hardware» more  ICCD 2004»
15 years 7 months ago
Dynamic Address Compression Schemes: A Performance, Energy, and Cost Study
Dynamic address compression schemes that exploit address locality can help reduce both address bus energy and cost simultaneously with only a small performance penalty. In this wo...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...