20778 search results - page 456 / 4156 » Algorithms for Data Migration |
189
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
162
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
There has been a considerable body of work on search–based test data generation for branch coverage. However, hitherto, there has been no work on multi–objective branch covera...
220
click to vote
PPAM
2007
Springer
16 years 29 days ago
2007
Springer
For about ten years now, Bo K˚agstr¨om’s Group in Umea, Sweden, Jerzy Wa´sniewski’s Team at Danish Technical University in Lyngby, Denmark, and I at IBM Research in Yorktown...
198
click to vote
ICPADS
2005
IEEE
16 years 13 days ago
2005
IEEE
This work presents a new comparison-based diagnosis model and a new algorithm, called Hi-Dif, based on this model. The algorithm is used for checking the integrity of systems with...
202
click to vote
MDM
2005
Springer
16 years 10 days ago
2005
Springer
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...