Sciweavers

4117 search results - page 9 / 824
» On the Satisfiability of Complex Constraints
Sort
View
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 1 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo
ISCAS
2007
IEEE
99views Hardware» more  ISCAS 2007»
15 years 3 months ago
A Parallel Architecture for Hermitian Decoders: Satisfying Resource and Throughput Constraints
— Hermitian Codes offer desirable properties such as large code lengths, good error-correction at high code rates, etc. The main problem in making Hermitian codes practical is to...
Rachit Agarwal, Emanuel M. Popovici, Brendan O'Fly...
JUCS
2007
118views more  JUCS 2007»
14 years 9 months ago
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
Gabriel Istrate
JAR
2000
129views more  JAR 2000»
14 years 9 months ago
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...
VLSID
2002
IEEE
130views VLSI» more  VLSID 2002»
15 years 9 months ago
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
Anupam Datta, Sidharth Choudhury, Anupam Basu