188 search results - page 21 / 38 » Evolutionary Algorithms for Vertex Cover |
152
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
111
click to vote
CCGRID
2003
IEEE
15 years 6 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
SBIA
2004
Springer
15 years 6 months ago
2004
Springer
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
105
click to vote
EMO
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Multiplex Polymerase Chain Reaction (PCR) assay is to amplify multiple target DNAs simultaneously using different primer pairs for each target DNA. Recently, it is widely...
143
click to vote
FOCS
2003
IEEE
15 years 6 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...