Sciweavers

1170 search results - page 182 / 234
» How Fast Is Too Fast
Sort
View
ATAL
2010
Springer
15 years 4 months ago
Finding approximate competitive equilibria: efficient and fair course allocation
In the course allocation problem, a university administrator seeks to efficiently and fairly allocate schedules of over-demanded courses to students with heterogeneous preferences...
Abraham Othman, Tuomas Sandholm, Eric Budish
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 4 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
111
Voted
DAC
2010
ACM
15 years 3 months ago
Performance and power modeling in a multi-programmed multi-core environment
This paper describes a fast, automated technique for accurate on-line estimation of the performance and power consumption of interacting processes in a multi-programmed, multi-cor...
Xi Chen, Chi Xu, Robert P. Dick, Zhuoqing Morley M...
122
Voted
SIGCOMM
2010
ACM
15 years 3 months ago
NetShield: massive semantics-based vulnerability signature matching for high-speed networks
Accuracy and speed are the two most important metrics for Network Intrusion Detection/Prevention Systems (NIDS/NIPSes). Due to emerging polymorphic attacks and the fact that in ma...
Zhichun Li, Gao Xia, Hongyu Gao, Yi Tang, Yan Chen...
SIGMOD
2010
ACM
208views Database» more  SIGMOD 2010»
15 years 3 months ago
Hierarchically organized skew-tolerant histograms for geographic data objects
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...
Yohan J. Roh, Jae Ho Kim, Yon Dohn Chung, Jin Hyun...