Sciweavers

114 search results - page 12 / 23
» Identifying Dynamic Sequential Plans
Sort
View
ATAL
2007
Springer
14 years 2 months ago
Estimating information value in collaborative multi-agent planning systems
This paper addresses the problem of identifying the value of information held by a teammate on a distributed, multi-agent team. It focuses on a distributed scheduling task in whic...
David Sarne, Barbara J. Grosz
IJCAI
2007
13 years 10 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
AIPS
1998
13 years 10 months ago
Solving Stochastic Planning Problems with Large State and Action Spaces
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
Thomas Dean, Robert Givan, Kee-Eung Kim
EOR
2006
117views more  EOR 2006»
13 years 8 months ago
Heuristics for selecting robust database structures with dynamic query patterns
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...
Andrew N. K. Chen, Paulo B. Goes, Alok Gupta, Jame...
BMCBI
2010
111views more  BMCBI 2010»
13 years 8 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
Hedda Høvik, Tsute Chen