Sciweavers

427 search results - page 46 / 86
» A Subexponential Bound for Linear Programming
Sort
View
FOGA
2011
12 years 11 months ago
Approximating the distribution of fitness over hamming regions
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
IJCGA
2000
64views more  IJCGA 2000»
13 years 7 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
TON
2012
11 years 10 months ago
Static Routing and Wavelength Assignment for Multicast Advance Reservation in All-Optical Wavelength-Routed WDM Networks
—In this paper we investigate the static multicast advance reservation (MCAR) problem for all-optical wavelengthrouted WDM networks. Under the advanced reservation traffic model...
Neal Charbonneau, Vinod Vokkarane
ICCV
2005
IEEE
14 years 9 months ago
A New Framework for Approximate Labeling via Graph Cuts
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
Nikos Komodakis, Georgios Tziritas
ICRA
2006
IEEE
125views Robotics» more  ICRA 2006»
14 years 1 months ago
Optimal Information Propagation in Sensor Networks
Abstract— This paper studies the effect of communicationlink weighting schemes and long-range connections in speeding convergence to consensus on the average of the inputs to age...
Peng Yang, Randy A. Freeman, Kevin M. Lynch