Sciweavers

2100 search results - page 129 / 420
» Observation Can Be as Effective as Action in Problem Solving
Sort
View
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
14 years 3 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...
ATAL
2005
Springer
14 years 2 months ago
Multi-agent reward analysis for learning in noisy domains
In many multi agent learning problems, it is difficult to determine, a priori, the agent reward structure that will lead to good performance. This problem is particularly pronoun...
Adrian K. Agogino, Kagan Tumer
AI
2008
Springer
13 years 9 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
TKDE
2010
148views more  TKDE 2010»
13 years 7 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang
AAAI
2006
13 years 10 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet