Sciweavers

1959 search results - page 272 / 392
» Concerned About Separation
Sort
View
AIPS
2000
15 years 5 months ago
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches
We develop an algorithm for merging plans that are represented in a richly expressive language. Speci cally, weare concerned with plans that have i quantitative temporal constrain...
Ioannis Tsamardinos, Martha E. Pollack, John F. Ho...
SODA
2003
ACM
132views Algorithms» more  SODA 2003»
15 years 5 months ago
Online learning in online auctions
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids are received and dealt with one-by-one. In this note, we demonstrate that resul...
Avrim Blum, Vijay Kumar, Atri Rudra, Felix Wu
ICMAS
2000
15 years 5 months ago
Justifying Multiply Sectioned Bayesian Networks
We consider multiple agents who's task is to determine the true state of a uncertain domain so they can act properly. If each agent only has partial knowledge about the domai...
Yang Xiang, Victor R. Lesser
UAI
1997
15 years 5 months ago
Score and Information for Recursive Exponential Models with Incomplete Data
Recursive graphical models usually underlie the statistical modelling concerning probabilistic expert systems based on Bayesian networks. This paper de nes a version of these mode...
Bo Thiesson
130
Voted
AAAI
1996
15 years 5 months ago
Agent Amplified Communication
We propose an agent-based framework for assisting and simplifying person-to-person communication for information gathering tasks. As an example, we focus on locating experts for a...
Henry A. Kautz, Bart Selman, Al Milewski