Sciweavers

4860 search results - page 279 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
74
Voted
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 6 months ago
Niching in evolution strategies
Evolutionary Algorithms (EAs), popular search methods for solving search and optimization problems, are known for successful and fast location of single optimal solutions. However,...
Ofer M. Shir, Thomas Bäck
CORR
2012
Springer
176views Education» more  CORR 2012»
13 years 8 months ago
Capturing Topology in Graph Pattern Matching
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
Shuai Ma, Yang Cao, Wenfei Fan, Jinpeng Huai, Tian...
86
Voted
TROB
2008
112views more  TROB 2008»
15 years 17 days ago
A Complete and Scalable Strategy for Coordinating Multiple Robots Within Roadmaps
Abstract--This paper addresses the challenging problem of finding collision-free trajectories for many robots moving toward individual goals within a common environment. Most popul...
Mike Peasgood, Christopher M. Clark, John McPhee
TPDS
2008
125views more  TPDS 2008»
15 years 17 days ago
Computation-Efficient Multicast Key Distribution
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied ...
Lihao Xu, Cheng Huang
WDAG
1998
Springer
123views Algorithms» more  WDAG 1998»
15 years 4 months ago
Propagation and Leader Election in a Multihop Broadcast Environment
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
Israel Cidon, Osnat Mokryn