Sciweavers

4908 search results - page 338 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
DSN
2009
IEEE
16 years 1 months ago
A QoS-aware fault tolerant middleware for dependable service composition
Based on the framework of service-oriented architecture (SOA), complex distributed systems can be dynamically and automatically composed by integrating distributed Web services pr...
Zibin Zheng, Michael R. Lyu
GLOBECOM
2009
IEEE
16 years 1 months ago
Revenue Maximization for Communication Networks with Usage-Based Pricing
—We study the optimal usage-based pricing problem in a resource-bounded network with one profit-maximizing service provider and multiple groups of surplus-maximizing users. We ...
Shuqin Li, Jianwei Huang, Shuo-Yen Robert Li
GECCO
2009
Springer
121views Optimization» more  GECCO 2009»
16 years 1 months ago
Evolutionary algorithms and dynamic programming
Recently, it has been proven that evolutionary algorithms produce good results for a wide range of combinatorial optimization problems. Some of the considered problems are tackled...
Benjamin Doerr, Anton Eremeev, Christian Horoba, F...
GLOBECOM
2008
IEEE
16 years 1 months ago
Cross-Layer Design with Adaptive Modulation: Delay, Rate, and Energy Tradeoffs
— We present a crosslayer framework for optimizing the performance of wireless networks as measured by applications or upper layer protocols. The approach combines adaptive modul...
Daniel O'Neill, Andrea J. Goldsmith, Stephen P. Bo...
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
16 years 28 days ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli