2214 search results - page 411 / 443 » Complexity of Reasoning |
109
click to vote
MMSEC
2004
ACM
15 years 5 months ago
2004
ACM
Watermarking of 3D meshes has received a limited attention due to the difficulties encountered in extending the algorithms developed for 1D (audio) and 2D (images and video) signa...
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
122
click to vote
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
102
click to vote
EMSOFT
2004
Springer
15 years 5 months ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...