Sciweavers

5595 search results - page 9 / 1119
» Comparing Subsumption Optimizations
Sort
View
IJCAI
2003
13 years 8 months ago
Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment
Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounde...
Heath Hohwald, Ignacio Thayer, Richard E. Korf
MOBICOM
2004
ACM
14 years 23 days ago
Performance optimizations for wireless wide-area networks: comparative study and experimental evaluation
We present a comparative performance study of a wide selection of optimization techniques to enhance application performance in the context of wide-area wireless networks (WWANs)....
Rajiv Chakravorty, Suman Banerjee, Pablo Rodriguez...
IPPS
1998
IEEE
13 years 11 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
Comparative optimism in models involving both classical clinical and gene expression information
Background: In cancer research, most clinical variables have already been investigated and are now well established. The use of transcriptomic variables has raised two problems: r...
Caroline Truntzer, Delphine Maucort-Boulch, Pascal...
EVOW
2006
Springer
13 years 11 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
Olfa Sammoud, Sébastien Sorlin, Christine S...