Sciweavers

2244 search results - page 31 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
BIOCOMP
2006
15 years 7 months ago
A Heuristic Approach to Scoring Gene Clustering Algorithms
In the past decades, many clustering algorithms have been proposed for the analysis of gene expression data, but little guidance is available to help choose among them. Given the ...
Longde Yin, Chun-Hsi Huang
TMC
2010
167views more  TMC 2010»
15 years 23 days ago
Optimal Speed Control of Mobile Node for Data Collection in Sensor Networks
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
Ryo Sugihara, Rajesh K. Gupta
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
16 years 2 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
JOTA
2010
127views more  JOTA 2010»
15 years 26 days ago
Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems
We consider multi-objective convex optimal control problems. First we state a relationship between the (weakly or properly) efficient set of the multi-objective problem and the sol...
Henri Bonnel, C. Yalçin Kaya
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 9 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant