1964 search results - page 86 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
110
Voted
AAAI
2004
15 years 3 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
133
click to vote
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
116
click to vote
CHARME
2001
Springer
15 years 6 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
116
Voted
ICWS
2007
IEEE
15 years 3 months ago
2007
IEEE
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
100
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
We present a task duplication based scalable scheduling algorithm for Symmetric Multiprocessors (SMP), called S3MP (Scalable Scheduling for SMP), to address the problem of task sc...