159 search results - page 20 / 32 » Computing minimum cuts by randomized search heuristics |
87
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
115
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
This paper presents an study about a new Hybrid method GRASPES - for time series prediction, inspired in F. Takens theorem and based on a multi-start metaheuristic for combinatori...
BIBE
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
105
click to vote
INFOCOM
2000
IEEE
15 years 4 months ago
2000
IEEE
— We study wavelength assignment for lightpaths over WDM rings to minimize the SONET ADMs used. This problem has attracted much attention recently. However, its computation compl...
ICDCSW
2006
IEEE
15 years 6 months ago
2006
IEEE
— Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simpl...