Sciweavers

982 search results - page 79 / 197
» Solving Steiner tree problems in graphs to optimality
Sort
View
EUROGP
2001
Springer
106views Optimization» more  EUROGP 2001»
15 years 2 months ago
Linear-Tree GP and Its Comparison with Other GP Structures
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
Wolfgang Kantschik, Wolfgang Banzhaf
TIT
2008
74views more  TIT 2008»
14 years 10 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
INFOCOM
1999
IEEE
15 years 2 months ago
Resource Allocation in a Multicast Tree
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
Murali S. Kodialam, Steven H. Low
CVPR
2009
IEEE
16 years 5 months ago
Unsupervised Learning of Hierarchical Spatial Structures In Images
The visual world demonstrates organized spatial patterns, among objects or regions in a scene, object-parts in an object, and low-level features in object-parts. These classes o...
Devi Parikh (Carnegie Mellon University), C. Lawre...
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 7 months ago
Bumblebees: a multiagent combinatorial optimization algorithm inspired by social insect behaviour
This paper introduces a multiagent optimization algorithm inspired by the collective behavior of social insects. In our method, each agent encodes a possible solution of the probl...
Francesc Comellas, Jesus Martinez-Navarro