Sciweavers

794 search results - page 21 / 159
» Improved algorithms for orienteering and related problems
Sort
View
WCRE
1999
IEEE
15 years 10 months ago
Type-Check Elimination: Two Object-Oriented Reengineering Patterns
In reengineering an object-oriented system we want to benefit from the expertise developed in earlier efforts. It is therefore essential to have a way to communicate expertise at ...
Stéphane Ducasse, Tamar Richner, Robb Nebbe
BMCBI
2006
139views more  BMCBI 2006»
15 years 6 months ago
Improvement in accuracy of multiple sequence alignment using novel group-to-group sequence alignment algorithm with piecewise li
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
Shinsuke Yamada, Osamu Gotoh, Hayato Yamana
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 17 days ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
CORR
2007
Springer
187views Education» more  CORR 2007»
15 years 6 months ago
Transaction-Oriented Simulation In Ad Hoc Grids
In this paper we analyse the requirements of performing parallel transaction-oriented simulations within loosely coupled systems like Ad Hoc Grids. We focus especially on the spac...
Gerald Krafft
JCM
2008
63views more  JCM 2008»
15 years 6 months ago
A Node Encoding of Torus Topology and Its Improved Routing Algorithm
With the feature size of semiconductor technology reducing and intellectual properties (IP) cores increasing, on chip communication architectures have a great influence on the perf...
Xiaoqiang Yang, Junmin Li, Huimin Du, Jungang Han