Sciweavers

1702 search results - page 101 / 341
» Using Nondeterminism to Design Efficient Deterministic Algor...
Sort
View
DAC
2001
ACM
14 years 11 months ago
Chaff: Engineering an Efficient SAT Solver
Boolean Satisfiability is probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying to provide practical solutions to ...
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao,...
PODS
2006
ACM
96views Database» more  PODS 2006»
14 years 10 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
ECCV
2008
Springer
14 years 8 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
MSWIM
2006
ACM
14 years 4 months ago
An efficient multicast packet delivery scheme for UMTS
In this paper we present an efficient scheme for the multicast transmission of the data in the Universal Mobile Telecommunications System (UMTS). We take advantage of the tree top...
Antonios G. Alexiou, Dimitrios Antonellis, Christo...
DAC
2005
ACM
14 years 3 days ago
Efficient and accurate gate sizing with piecewise convex delay models
We present an efficient and accurate gate sizing tool that employs a novel piecewise convex delay model, handling both rise and fall delays, for static CMOS gates. The delay model...
Hiran Tennakoon, Carl Sechen