Sciweavers

1964 search results - page 164 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
EVOW
2001
Springer
14 years 17 days ago
An Evolutionary Annealing Approach to Graph Coloring
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
Dimitris Fotakis, Spiridon D. Likothanassis, Stama...
ICDCS
2005
IEEE
14 years 1 months ago
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
Ranganath Atreya, Neeraj Mittal
HPCN
1998
Springer
14 years 9 days ago
A Barotropic Global Ocean Model and its Parallel Implementation on Unstructured Grids
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
Hakan Öksüzoglu, A. G. M. van Hees
PKDD
2010
Springer
125views Data Mining» more  PKDD 2010»
13 years 6 months ago
NDPMine: Efficiently Mining Discriminative Numerical Features for Pattern-Based Classification
Abstract. Pattern-based classification has demonstrated its power in recent studies, but because the cost of mining discriminative patterns as features in classification is very ex...
Hyungsul Kim, Sangkyum Kim, Tim Weninger, Jiawei H...
JCM
2007
76views more  JCM 2007»
13 years 8 months ago
Scheduling Small Packets in IPSec Multi-accelerator Based Systems
—IPSec is a suite of protocols that adds security to communications at the IP level. Protocols within the IPSec suite make extensive use of cryptographic algorithms. Since these ...
Antonio Vincenzo Taddeo, Alberto Ferrante, Vincenz...