2649 search results - page 139 / 530 » Argumentation for Decision Support |
164
click to vote
ICCAD
2001
IEEE
16 years 3 months ago
2001
IEEE
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
188
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
ShareStreams (Scalable Hardware Architectures for Stream Schedulers) is a canonical architecture for realizing a range of scheduling disciplines. This paper discusses the design c...
168
click to vote
JAIR
2000
15 years 6 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
174
click to vote
PLDI
2010
ACM
15 years 11 months ago
2010
ACM
Energy-efficient computing is important in several systems ranging from embedded devices to large scale data centers. Several application domains offer the opportunity to tradeof...
143
click to vote
LCPC
1994
Springer
15 years 10 months ago
1994
Springer
We have recently introduced a new language, called Opus, which provides a set of Fortranlanguage extensions that allow for integrated support of task and data parallelism. It also...