Sciweavers

1985 search results - page 212 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
KDD
2003
ACM
162views Data Mining» more  KDD 2003»
16 years 4 months ago
Improving spatial locality of programs via data mining
In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this pape...
Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K...
ESA
1995
Springer
127views Algorithms» more  ESA 1995»
15 years 7 months ago
Optimized Binary Search and Text Retrieval
We present an algorithm that minimizes the expected cost of indirect binary search for data with non-constant access costs, such as disk data. Indirect binary search means that sor...
Eduardo F. Barbosa, Gonzalo Navarro, Ricardo A. Ba...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 6 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
MOBIDE
2010
ACM
15 years 4 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
AMC
2007
129views more  AMC 2007»
15 years 4 months ago
Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
Peng-Yeng Yin, Shiuh-Sheng Yu, Pei-Pei Wang, Yi-Te...