Sciweavers

1964 search results - page 220 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 12 months ago
A general coarse-graining framework for studying simultaneous inter-population constraints induced by evolutionary operations
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
Keki M. Burjorjee, Jordan B. Pollack
CORR
2011
Springer
179views Education» more  CORR 2011»
13 years 3 months ago
Cooperative searching for stochastic targets
Spatial search problems abound in the real world, from locating hidden nuclear or chemical sources to finding skiers after an avalanche. We exemplify the formalism and solution fo...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
FOCS
2002
IEEE
14 years 1 months ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg
TACAS
2009
Springer
128views Algorithms» more  TACAS 2009»
14 years 3 months ago
All-Termination(T)
We introduce the All-Termination(T) problem: given a termination solver, T, and a program (a set of functions), find every set of formal arguments whose consideration is sufficie...
Panagiotis Manolios, Aaron Turon
SECON
2010
IEEE
13 years 6 months ago
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Efficient Approximations
In a wireless sensor network, short range multihop transmissions are preferred to prolong the network lifetime due to super-linear nature of energy consumption with communication d...
Dejun Yang, Satyajayant Misra, Xi Fang, Guoliang X...