Sciweavers

3894 search results - page 556 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
IJCAI
2007
15 years 5 months ago
Coalitional Bargaining with Agent Type Uncertainty
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, individually rational agents to form stable teams. Automating the negotiations underlying ...
Georgios Chalkiadakis, Craig Boutilier
NIPS
2008
15 years 5 months ago
Multi-Agent Filtering with Infinitely Nested Beliefs
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...
Luke S. Zettlemoyer, Brian Milch, Leslie Pack Kael...
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
15 years 4 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 3 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
99
Voted
TNN
2008
82views more  TNN 2008»
15 years 3 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...