Sciweavers

2543 search results - page 354 / 509
» Optimal Ordered Problem Solver
Sort
View
AIPS
2006
15 years 2 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
POPL
2007
ACM
16 years 1 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
90
Voted
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 29 days ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
DCC
2008
IEEE
16 years 8 days ago
Asymmetric Multi-level Diversity Coding
Symmetric multilevel diversity coding was introduced by Roche et al, where a set of K information sources is encoded by K encoders and the decoders reconstruct sources 1, . . . , ...
Soheil Mohajer, Chao Tian, Suhas N. Diggavi
104
Voted
COCOA
2009
Springer
15 years 7 months ago
Recoverable Robust Timetables on Trees
In the context of scheduling and timetabling, we study a challenging combinatorial problem which is very interesting for both practical and theoretical points of view. The motivati...
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo...