Sciweavers

8067 search results - page 118 / 1614
» A Model Proposal of the Interoperability Problem
Sort
View
125
Voted
ESCIENCE
2006
IEEE
15 years 9 months ago
Grid Approach to Embarrassingly Parallel CPU-Intensive Bioinformatics Problems
Bioinformatics algorithms such as sequence alignment methods based on profile-HMM (Hidden Markov Model) are popular but CPU-intensive. If large amounts of data are processed, a s...
Heinz Stockinger, Marco Pagni, Lorenzo Cerutti, La...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
15 years 9 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
135
Voted
ITRUST
2005
Springer
15 years 9 months ago
Alleviating the Sparsity Problem of Collaborative Filtering Using Trust Inferences
Collaborative Filtering (CF), the prevalent recommendation approach, has been successfully used to identify users that can be characterized as “similar” according to their logg...
Manos Papagelis, Dimitris Plexousakis, Themistokli...
ATAL
2008
Springer
15 years 5 months ago
Evaluating the performance of DCOP algorithms in a real world, dynamic problem
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
Robert Junges, Ana L. C. Bazzan
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 4 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...