Sciweavers

1717 search results - page 72 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
ISTCS
1997
Springer
15 years 10 months ago
Exact Analysis of Exact Change
We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...
Pat Frankel
ICN
2007
Springer
16 years 9 days ago
CoLoRaDe: A Novel Algorithm for Controlling Long-Range Dependent Network Traffic
Long-range dependence characteristics have been observed in many natural or physical phenomena. In particular, a significant impact on data network performance has been shown in se...
Karim Mohammed Rezaul, Vic Grout
ECCV
2004
Springer
16 years 8 months ago
A Robust Algorithm for Characterizing Anisotropic Local Structures
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
Kazunori Okada, Dorin Comaniciu, Navneet Dalal, Ar...
BMCBI
2007
104views more  BMCBI 2007»
15 years 6 months ago
A response to Yu et al. "A forward-backward fragment assembling algorithm for the identification of genomic amplification and de
Background: Yu et al. (BMC Bioinformatics 2007,8: 145+) have recently compared the performance of several methods for the detection of genomic amplification and deletion breakpoin...
Oscar M. Rueda, Ramón Díaz-Uriarte
ICALP
2011
Springer
14 years 9 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...