Sciweavers

686 search results - page 100 / 138
» On the General Applicability of Instruction-Set Randomizatio...
Sort
View
SIROCCO
2008
13 years 10 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 10 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,...
BMVC
2000
13 years 10 months ago
The Cross Ratio: A Revisit to its Probability Density Function
The cross ratio has wide applications in computer vision because of its invariance under projective transformation. In active vision where the projections of quadruples of colline...
D. Q. Huynh
WSC
1998
13 years 10 months ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese
ISMB
1997
13 years 10 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey