1998 search results - page 83 / 400 » Complexity of the Cover Polynomial |
128
click to vote
AIPS
2008
15 years 7 months ago
2008
We present a faster method of solving optimal planning problems and show that our solution performs up to an order of magnitude faster than Satplan on a variety of problems from t...
144
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
207
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
142
Voted
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
The quest for a vision system capable of representing and recognizing arbitrary motions benefits from a low dimensional, non-specific representation of flow fields, to be used in ...
155
click to vote
ICDCS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...