Sciweavers

42230 search results - page 245 / 8446
» Algorithms and Complexity Results for
Sort
View
169
Voted
IAJIT
2010
115views more  IAJIT 2010»
15 years 5 months ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 6 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 10 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
15 years 1 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy