2905 search results - page 289 / 581 » Formal Memetic Algorithms |
182
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
RECOMB
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
MOBIHOC
2008
ACM
15 years 10 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
ATS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
INFOCOM
2009
IEEE
15 years 5 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...