Sciweavers

5138 search results - page 372 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
IPPS
2007
IEEE
16 years 1 months ago
Effects of Replica Placement Algorithms on Performance of structured Overlay Networks
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
Bassam A. Alqaralleh, Chen Wang, Bing Bing Zhou, A...
ICALP
2007
Springer
16 years 26 days ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
WIOPT
2006
IEEE
16 years 21 days ago
Flow-level stability of channel-aware scheduling algorithms
— Channel-aware scheduling strategies provide an effective mechanism for improving the throughput performance in wireless data networks by exploiting channel fluctuations. The p...
Sem C. Borst, Matthieu Jonckheere
AUSAI
2005
Springer
16 years 7 days ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry