Sciweavers

1029 search results - page 195 / 206
» Neural Networks and Complexity Theory
Sort
View
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
15 years 5 months ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
SPAA
2010
ACM
15 years 4 months ago
Collaborative scoring with dishonest participants
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti R...
FOCS
1997
IEEE
15 years 4 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
FPL
2004
Springer
100views Hardware» more  FPL 2004»
15 years 3 months ago
On Optimal Irregular Switch Box Designs
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
Hongbing Fan, Yu-Liang Wu, Chak-Chung Cheung, Jipi...
FORTE
2008
15 years 1 months ago
An SMT Approach to Bounded Reachability Analysis of Model Programs
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
Margus Veanes, Nikolaj Bjørner, Alexander R...