Sciweavers

1717 search results - page 218 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
PODC
2010
ACM
15 years 1 months ago
Brief announcement: towards robust medium access in multi-hop networks
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
Andréa W. Richa, Jin Zhang, Christian Schei...
ATAL
2006
Springer
15 years 1 months ago
Learning to identify winning coalitions in the PAC model
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
Ariel D. Procaccia, Jeffrey S. Rosenschein
COCOON
2005
Springer
14 years 12 months ago
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
W. Henry Suters, Faisal N. Abu-Khzam, Yun Zhang, C...
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
14 years 11 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
SODA
2004
ACM
96views Algorithms» more  SODA 2004»
14 years 11 months ago
Non-migratory online deadline scheduling on multiprocessors
In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can ...
Ho-Leung Chan, Tak Wah Lam, Kar-Keung To