Sciweavers

511 search results - page 16 / 103
» Using Combinatorial Optimization Methods for Quantification ...
Sort
View
WSC
1998
14 years 11 months ago
An Analytical Comparison of Optimization Problem Generation Methodologies
Heuristics are an increasingly popular solution method for combinatorial optimization problems. Heuristic use often frees the modeler from some of the restrictions placed on class...
Raymond R. Hill
BMCBI
2006
110views more  BMCBI 2006»
14 years 9 months ago
Design of a combinatorial DNA microarray for protein-DNA interaction studies
Background: Discovery of precise specificity of transcription factors is an important step on the way to understanding the complex mechanisms of gene regulation in eukaryotes. Rec...
Julian Mintseris, Michael B. Eisen
COCOA
2008
Springer
14 years 11 months ago
Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization
Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage r...
Karine Deschinkel, Sid Ahmed Ali Touati
MVA
1998
230views Computer Vision» more  MVA 1998»
14 years 11 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...
KDD
2009
ACM
140views Data Mining» more  KDD 2009»
15 years 10 months ago
Improving clustering stability with combinatorial MRFs
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
Ron Bekkerman, Martin Scholz, Krishnamurthy Viswan...