Sciweavers

3179 search results - page 154 / 636
» Applications of PCF Theory
Sort
View
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
14 years 3 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 3 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ICAIL
2003
ACM
14 years 3 months ago
Improving Legal Quality - an application report
Problems with legal quality will not only increase effort and costs of the law enforcement organisations, but also undermines the regulating power of the legislator. Unintended us...
Tom M. van Engers, Margherita R. Boekenoogen
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
14 years 2 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 2 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve