Sciweavers

741 search results - page 94 / 149
» A Note on the Use of Independent Sets for the k-SAT Problem
Sort
View
RTSS
2008
IEEE
14 years 3 months ago
Synthesis of Optimal Interfaces for Hierarchical Scheduling with Resources
This paper presents algorithms that (1) facilitate systemindependent synthesis of timing-interfaces for subsystems and (2) system-level selection of interfaces to minimize CPU loa...
Insik Shin, Moris Behnam, Thomas Nolte, Mikael Nol...
FOCS
2006
IEEE
14 years 2 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
EOR
2008
78views more  EOR 2008»
13 years 8 months ago
Maximizing throughput in queueing networks with limited flexibility
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
Douglas G. Down, George Karakostas
ISPDC
2010
IEEE
13 years 7 months ago
Practical Uniform Peer Sampling under Churn
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
Roberto Baldoni, Marco Platania, Leonardo Querzoni...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 9 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa