380 search results - page 61 / 76 » Cluster Graphs as Abstractions for Constraint Satisfaction P... |
APPROX
2006
Springer
14 years 11 days ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
EURODAC
1995
IEEE
14 years 5 days ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
SIROCCO
1997
13 years 10 months ago
1997
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
FOCS
1998
IEEE
14 years 27 days ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...