1717 search results - page 18 / 344 » On the analysis of the (1 1) memetic algorithm |
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
CSCLP
2005
Springer
14 years 1 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— In this paper, we present a Minimum Spanning Tree (MST) based topology control algorithm, called Local Minimum Spanning Tree (LMST), for wireless multi-hop networks. In this al...
CSL
2009
Springer
14 years 3 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...