380 search results - page 43 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
100
click to vote
CLUSTER
2005
IEEE
15 years 5 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, ...
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. While several powerful methods exist for automatically detecting symmetries in instances of constraint satisfaction problems (CSPs), current methods for detecting symmetr...
112
click to vote
DATE
2004
IEEE
15 years 3 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
111
click to vote
KDD
2007
ACM
16 years 5 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
121
click to vote
ISDA
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...