Sciweavers

15485 search results - page 2839 / 3097
» Computing Optimal Subsets
Sort
View
DPD
2010
153views more  DPD 2010»
15 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
EOR
2010
113views more  EOR 2010»
15 years 4 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
IJPP
2010
156views more  IJPP 2010»
15 years 3 months ago
ForestGOMP: An Efficient OpenMP Environment for NUMA Architectures
Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform ar...
François Broquedis, Nathalie Furmento, Bric...
IJWMC
2010
115views more  IJWMC 2010»
15 years 3 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James
ISF
2010
164views more  ISF 2010»
15 years 3 months ago
An SVM-based machine learning method for accurate internet traffic classification
Accurate and timely traffic classification is critical in network security monitoring and traffic engineering. Traditional methods based on port numbers and protocols have proven t...
Ruixi Yuan, Zhu Li, Xiaohong Guan, Li Xu
« Prev « First page 2839 / 3097 Last » Next »