3220 search results - page 498 / 644 » Constrained Graph Processes |
162
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
140
click to vote
DEXA
1998
Springer
15 years 10 months ago
1998
Springer
Prototype databases are needed in any information system development process to support data-intensive applications development. It is common practice to populate these databases u...
178
click to vote
PLILP
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
144
click to vote
ACSC
2006
IEEE
15 years 10 months ago
2006
IEEE
Communications devices intended for use in securitycritical applications must be rigorously evaluated to ensure they preserve data confidentiality. This process includes tracing t...
176
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Many real world applications rely on the discovery of maximal biclique subgraphs (complete bipartite subgraphs). However, existing algorithms for enumerating maximal bicl...