11740 search results - page 104 / 2348 » More Problems in Rewriting |
96
Voted
SARA
2009
Springer
15 years 7 months ago
2009
Springer
Despite a big progress in solving planning problems, more complex problems still remain hard and challenging for existing planners. One of the most promising research directions i...
100
Voted
SIAMJO
2008
15 years 19 days ago
2008
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
126
Voted
SOCO
2010
Springer
14 years 7 months ago
2010
Springer
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
117
click to vote
CSFW
2011
IEEE
14 years 16 days ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
84
Voted
TCS
2002
15 years 11 days ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...