180 search results - page 33 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
EDOC
2007
IEEE
13 years 11 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, ...
ICCAD
2004
IEEE
14 years 4 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—The sustained push for performance, transistor count, and instruction level parallelism has reached a point where chip level power density issues are at the forefront of design ...