Sciweavers

1532 search results - page 149 / 307
» A Comparison of RESTART Implementations
Sort
View
111
Voted
EATIS
2007
ACM
15 years 7 months ago
Techniques for location selection on a mobile device
In the current paper we present a field comparison of techniques for selecting one's current location in mobile locationbased systems. Four location selection techniques are ...
Mika Luimula, Kirsti Sääskilahti, Timo P...
ESA
2007
Springer
122views Algorithms» more  ESA 2007»
15 years 7 months ago
A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
Cristina Bazgan, Hadrien Hugot, Daniel Vanderpoote...
ACSC
2004
IEEE
15 years 7 months ago
Homeless and Home-based Lazy Release Consistency Protocols on Distributed Shared Memory
This paper describes the comparison between homeless and home-based Lazy Release Consistency (LRC) protocols which are used to implement Distributed Shared Memory (DSM) in cluster...
Byung-Hyun Yu, Zhiyi Huang, Stephen Cranefield, Ma...
COMPGEOM
2000
ACM
15 years 7 months ago
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...
Olivier Devillers, Alexandra Fronville, Bernard Mo...
ICALP
2000
Springer
15 years 7 months ago
An Optimal Minimum Spanning Tree Algorithm
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
Seth Pettie, Vijaya Ramachandran