Sciweavers

12257 search results - page 362 / 2452
» Analysis of Algorithms
Sort
View
ESOP
2000
Springer
15 years 7 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
TC
2008
15 years 4 months ago
Optimal and Practical Algorithms for Sorting on the PDM
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
Sanguthevar Rajasekaran, Sandeep Sen
ICML
2005
IEEE
16 years 5 months ago
Active learning for sampling in time-series experiments with application to gene expression analysis
Many time-series experiments seek to estimate some signal as a continuous function of time. In this paper, we address the sampling problem for such experiments: determining which ...
Rohit Singh, Nathan Palmer, David K. Gifford, Bonn...
CISIS
2008
IEEE
15 years 10 months ago
Adaptive Computational Chemotaxis in Bacterial Foraging Algorithm
Some researchers have illustrated how individual and groups of bacteria forage for nutrients and to model it as a distributed optimization process, which is called the Bacterial F...
Sambarta Dasgupta, Arijit Biswas, Ajith Abraham, S...
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
15 years 7 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...