Sciweavers

971 search results - page 157 / 195
» Approximate Satisfiability and Equivalence
Sort
View
ALT
2010
Springer
15 years 1 months ago
Inferring Social Networks from Outbreaks
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...
Dana Angluin, James Aspnes, Lev Reyzin
IPCO
2010
148views Optimization» more  IPCO 2010»
15 years 1 months ago
Prize-Collecting Steiner Network Problems
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
AAAI
2004
15 years 1 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
NIPS
2004
15 years 1 months ago
Learning first-order Markov models for control
First-order Markov models have been successfully applied to many problems, for example in modeling sequential data using Markov chains, and modeling control problems using the Mar...
Pieter Abbeel, Andrew Y. Ng
ECAI
2010
Springer
15 years 28 days ago
The Epistemic View of Belief Merging: Can We Track the Truth?
Abstract. Belief merging is often described as the process of defining a base which best represents the beliefs of a group of agents (a profile of belief bases). The resulting base...
Patricia Everaere, Sébastien Konieczny, Pie...