Sciweavers

696 search results - page 95 / 140
» A class of combinatorial identities
Sort
View
FOCS
2005
IEEE
15 years 11 months ago
Mechanism Design via Machine Learning
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
ANTSW
2004
Springer
15 years 11 months ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 11 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
ICDCS
2003
IEEE
15 years 11 months ago
Software Fault Tolerance of Distributed Programs Using Computation Slicing
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...
Neeraj Mittal, Vijay K. Garg
PPPJ
2003
ACM
15 years 11 months ago
A stochastic approach to automated design improvement
The object-oriented approach to software development facilitates and encourages programming practices that increase reusability, correctness and maintainability in code. This is a...
Mark Kent O'Keeffe, Mel Ó Cinnéide