Sciweavers

7758 search results - page 1550 / 1552
» On the Number of Distributive Lattices
Sort
View
TEC
2012
195views Formal Methods» more  TEC 2012»
11 years 8 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
SPAA
2009
ACM
14 years 7 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
PODS
2009
ACM
124views Database» more  PODS 2009»
14 years 7 months ago
Indexing uncertain data
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
Pankaj K. Agarwal, Siu-Wing Cheng, Yufei Tao, Ke Y...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 6 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
CLUSTER
2009
IEEE
14 years 1 months ago
Combining I/O operations for multiple array variables in parallel netCDF
—Parallel netCDF (PnetCDF) is a popular library used in many scientific applications to store scientific datasets. It provides high-performance parallel I/O while maintaining ...
Kui Gao, Wei-keng Liao, Alok N. Choudhary, Robert ...
« Prev « First page 1550 / 1552 Last » Next »