42230 search results - page 101 / 8446 » Algorithms and Complexity Results for |
IJCAI
1997
14 years 11 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...
AIPS
2009
14 years 11 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...
JAIR
2008
14 years 9 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...
102
click to vote
AIMDM
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes an approach to the detection of events in complex, multi-channel, high frequency data. The example used is that of detecting the re-siting of a transcutaneous ...
TCOM
2008
14 years 9 months ago
2008
Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum frontend detecti...