Sciweavers

54 search results - page 7 / 11
» New Algorithms for Minimum Area k-gons
Sort
View
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 8 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
BMCBI
2008
114views more  BMCBI 2008»
13 years 7 months ago
Partial mixture model for tight clustering of gene expression time-course
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
Yinyin Yuan, Chang-Tsun Li, Roland Wilson
JAL
2006
114views more  JAL 2006»
13 years 7 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
IOR
2010
100views more  IOR 2010»
13 years 6 months ago
Integrated Production and Outbound Distribution Scheduling: Review and Extensions
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...
Zhi-Long Chen
GECCO
2008
Springer
274views Optimization» more  GECCO 2008»
13 years 8 months ago
Bacterial foraging oriented by particle swarm optimization strategy for PID tuning
Proportional integral derivative (PID) controller tuning is an area of interest for researchers in many disciplines of science and engineering. This paper presents a new algorithm...
Wael Mansour Korani