721 search results - page 35 / 145 » On Generators of Random Quasigroup Problems |
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
VLSM
2005
Springer
14 years 1 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
MSWIM
2003
ACM
14 years 1 months ago
2003
ACM
Mobile Ad-Hoc Networks (MANETS) are networks of mobile nodes that do not have a fixed infrastructure. Recent research in this field addresses ways of solving existing problems i...
SIGMOD
1999
ACM
14 years 8 days ago
1999
ACM
A major bottleneck in implementing sampling as a primitive relational operation is the ine ciency ofsampling the output of a query. It is not even known whether it is possible to ...