Sciweavers

13603 search results - page 2636 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
AMAI
2004
Springer
15 years 3 months ago
Approximate Probabilistic Constraints and Risk-Sensitive Optimization Criteria in Markov Decision Processes
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...
Dmitri A. Dolgov, Edmund H. Durfee
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
15 years 3 months ago
Properties of NP-Complete Sets
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....
Christian Glaßer, Aduri Pavan, Alan L. Selma...
ECAI
2004
Springer
15 years 3 months ago
A Context-Based Model of Attention
d abstract)1 Niek Bergboer Eric Postma Jaap van den Herik Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, 6200 MD Maastricht It is well known t...
Niek Bergboer, Eric O. Postma, H. Jaap van den Her...
EGH
2004
Springer
15 years 3 months ago
A programmable vertex shader with fixed-point SIMD datapath for low power wireless applications
The real time 3D graphics becomes one of the attractive applications for 3G wireless terminals although their battery lifetime and memory bandwidth limit the system resources for ...
Ju-Ho Sohn, Ramchan Woo, Hoi-Jun Yoo
EMSOFT
2004
Springer
15 years 3 months ago
A model-based approach to integrating security policies for embedded devices
Embedded devices like smart cards can now run multiple interacting applications. A particular challenge in this domain is to dynamically integrate diverse security policies. In th...
Michael McDougall, Rajeev Alur, Carl A. Gunter
« Prev « First page 2636 / 2721 Last » Next »