Sciweavers

58 search results - page 6 / 12
» Approximate Solution Techniques for Factored First-Order MDP...
Sort
View
ATAL
2004
Springer
14 years 29 days ago
Decentralized Markov Decision Processes with Event-Driven Interactions
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
Raphen Becker, Shlomo Zilberstein, Victor R. Lesse...
GECCO
2008
Springer
192views Optimization» more  GECCO 2008»
13 years 8 months ago
Non-linear factor model for asset selection using multi objective genetic programming
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
Ghada Hassan
AI
2011
Springer
13 years 2 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 5 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
14 years 9 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...