Sciweavers

3192 search results - page 487 / 639
» The minimum latency problem
Sort
View
AUSAI
2005
Springer
16 years 14 days ago
K-Optimal Pattern Discovery: An Efficient and Effective Approach to Exploratory Data Mining
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
Geoffrey I. Webb
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
16 years 14 days ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
EMSOFT
2004
Springer
16 years 10 days ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
SWAT
2004
Springer
153views Algorithms» more  SWAT 2004»
16 years 8 days ago
Melding Priority Queues
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup,...
INFOCOM
2003
IEEE
16 years 6 days ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter