Sciweavers

22 search results - page 2 / 5
» Folding Variant Narrowing and Optimal Variant Termination
Sort
View
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 6 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
GECCO
2008
Springer
123views Optimization» more  GECCO 2008»
13 years 6 months ago
On hopeful monsters, neutral networks and junk code in evolving L-systems
This paper investigates L-system evolution through experiments with a simulation platform of virtual plants. The conducted simulations vary the occurrence probability of terminal ...
Stefan Bornhofen, Claude Lattaud
ASPDAC
2000
ACM
117views Hardware» more  ASPDAC 2000»
13 years 10 months ago
Improved algorithms for hypergraph bipartitioning
Multilevel Fiduccia-Mattheyses MLFM hypergraph partitioning 3, 22, 24 is a fundamental optimization in VLSI CAD physical design. The leading implementation, hMetis 23 , has sinc...
Andrew E. Caldwell, Andrew B. Kahng, Igor L. Marko...
INFORMS
2000
128views more  INFORMS 2000»
13 years 5 months ago
A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
We develop a variant of the Nelder-Mead (NM) simplex search procedure for stochastic simulation optimization that is designed to avoid many of the weaknesses encumbering such dire...
David G. Humphrey, James R. Wilson
MONET
2006
107views more  MONET 2006»
13 years 5 months ago
Utilization and fairness in spectrum assignment for opportunistic spectrum access
The Open Spectrum approach to spectrum access can achieve near-optimal utilization by allowing devices to sense and utilize available spectrum opportunistically. However, a naive d...
Chunyi Peng, Haitao Zheng, Ben Y. Zhao