10988 search results - page 244 / 2198 » Algorithmic Folding Complexity |
107
Voted
IJCAI
1997
15 years 5 months ago
1997
Although it is acknowledged that multi-way dataflow constraints are useful in interactive applications, concerns about their tractability have hindered their acceptance. Certain l...
126
Voted
AIPS
2009
15 years 5 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
127
click to vote
JAIR
2008
15 years 3 months ago
2008
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial-time algorithm that uses macros to generate pla...
160
click to vote
SIAMDM
2008
15 years 3 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
121
click to vote
MVA
2002
15 years 3 months ago
2002
In this paper, an efficient edge-based approach, including implementation of a hardware system, for locating car license plate area from images taken under relatively complex cond...