8413 search results - page 268 / 1683 » Ordering Problem Subgoals |
130
click to vote
HIPC
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
126
click to vote
IPCO
2007
15 years 4 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
114
click to vote
AIPS
2004
15 years 4 months ago
2004
This paper considers the problem of generating partial order schedules (
110
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
ESWS
2007
Springer
15 years 9 months ago
2007
Springer
Large and complex enterprise systems face the same kind of information processing problems that exist on the web in general, and constructing an ontology is a crucial part of many ...