Sciweavers

1176 search results - page 159 / 236
» Implicit Abstraction Heuristics
Sort
View
104
Voted
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 2 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
89
Voted
CONEXT
2008
ACM
15 years 2 months ago
EGOIST: overlay routing using selfish neighbor selection
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals ...
Georgios Smaragdakis, Vassilis Lekakis, Nikolaos L...
92
Voted
FMCAD
2008
Springer
15 years 2 months ago
Invariant-Strengthened Elimination of Dependent State Elements
Abstract-- This work presents a technology-independent synthesis optimization that is effective in reducing the total number of state elements of a design. It works by identifying ...
Michael L. Case, Alan Mishchenko, Robert K. Brayto...
ASAP
2010
IEEE
193views Hardware» more  ASAP 2010»
15 years 2 months ago
Automatic generation of polynomial-based hardware architectures for function evaluation
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca
PDPTA
2007
15 years 2 months ago
Brokering Algorithms for Composing Low Cost Distributed Storage Resources
Abstract In this paper we investigate the composition of cheap network storage resources to meet specific availability and capacity requirements. We show that the problem of find...
Jimmy Secretan, Malachi Lawson, Ladislau Böl&...