Sciweavers

10608 search results - page 380 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 4 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
108
Voted
ATAL
2008
Springer
15 years 3 months ago
Automatic Generation of Distributed Team Formation Algorithms from Organizational Models
Software systems are subject to ever increasing complexity and in need of efficient structuring. The concept of organization as an exand abstract real-world reference presents a pr...
Michael Köhler-Bußmeier, Matthias Weste...
95
Voted
ICCSA
2010
Springer
15 years 3 months ago
Efficient Algorithms for the 2-Center Problems
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
Tadao Takaoka
93
Voted
CATS
2007
15 years 2 months ago
A Linear Time Algorithm for Pricing European Sequential Barrier Options
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
Peng Gao, Ron van der Meyden
94
Voted
EDM
2010
129views Data Mining» more  EDM 2010»
15 years 2 months ago
Skill Set Profile Clustering: The Empty K-Means Algorithm with Automatic Specification of Starting Cluster Centers
While students' skill set profiles can be estimated with formal cognitive diagnosis models [8], their computational complexity makes simpler proxy skill estimates attractive [...
Rebecca Nugent, Nema Dean, Elizabeth Ayers