Sciweavers

2479 search results - page 243 / 496
» Quantum complexity theory
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young
CHI
2004
ACM
16 years 7 months ago
Persistence matters: making the most of chat in tightly-coupled work
How much history of the dialogue should a chat client include? Some chat clients have minimized the dialogue history to deploy the space for other purposes. A theory of conversati...
Darren Gergle, David R. Millen, Robert E. Kraut, S...
POPL
2005
ACM
16 years 7 months ago
A simple typed intermediate language for object-oriented languages
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
Juan Chen, David Tarditi
CADE
2006
Springer
16 years 7 months ago
Automatic Construction and Verification of Isotopy Invariants
Abstract. We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Is...
Volker Sorge, Andreas Meier, Roy L. McCasland, Sim...