Sciweavers

1422 search results - page 283 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
CIKM
2008
Springer
14 years 11 months ago
A language for manipulating clustered web documents results
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...
Gloria Bordogna, Alessandro Campi, Giuseppe Psaila...
CPAIOR
2008
Springer
14 years 11 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
RIVF
2003
14 years 11 months ago
Airspace Sectorization By Constraint Programming
—In this paper we consider the Airspace Sectorization Problem (ASP) where airspace has to be partitioned into a number of sectors, each sector being assigned to a team of air tra...
Huy Trandac, Philippe Baptiste, Vu Duong
98
Voted
HPDC
2010
IEEE
14 years 10 months ago
MPIPairwiseStatSig: parallel pairwise statistical significance estimation of local sequence alignment
Sequence comparison is considered as a cornerstone application in bioinformatics, which forms the basis of many other applications. In particular, pairwise sequence alignment is a...
Ankit Agrawal, Sanchit Misra, Daniel Honbo, Alok N...
BMCBI
2006
137views more  BMCBI 2006»
14 years 9 months ago
Chaos game representation for comparison of whole genomes
Background: Chaos game representation of genome sequences has been used for visual representation of genome sequence patterns as well as alignment-free comparisons of sequences ba...
Jijoy Joseph, Roschen Sasikumar