1964 search results - page 254 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
APN
2001
Springer
14 years 25 days ago
2001
Springer
Reachability analysis and simulation tools for high-level nets spend a significant amount of the computing time in performing enabling tests, determining the assignments under whi...
INFOCOM
2000
IEEE
14 years 21 days ago
2000
IEEE
—We address the issue of power-controlled shared channel access in future wireless networks supporting packetized data traffic, beyond the voice-oriented continuous traffic prima...
COR
2006
13 years 8 months ago
2006
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...