Sciweavers

1650 search results - page 79 / 330
» The HOM problem is decidable
Sort
View
AAAI
2012
12 years 15 days ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
AAAI
2012
12 years 14 days ago
Transportability of Causal Effects: Completeness Results
The study of transportability aims to identify conditions under which causal information learned from experiments can be reused in a different environment where only passive obser...
Elias Bareinboim, Judea Pearl
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 10 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
FSTTCS
2008
Springer
13 years 11 months ago
Analyzing Asynchronous Programs with Preemption
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Toui...
EXPERT
2007
109views more  EXPERT 2007»
13 years 10 months ago
Mexar2: AI Solves Mission Planner Problems
s planners work at a higher abstraction level while it performs low-level, often-repetitive tasks. It also helps them produce a plan rapidly, explore alternative solutions, and cho...
Amedeo Cesta, Gabriella Cortellessa, Michel Denis,...