2944 search results - page 401 / 589 » Improving Bound Propagation |
144
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
139
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
A monotone planar circuit (MPC) is a Boolean circuit that can be embedded in a plane, and that has only AND and OR gates. Yang showed that the one-input-face monotone planar circui...
167
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
165
click to vote
FOSSACS
2000
Springer
15 years 10 months ago
2000
Springer
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
162
click to vote
ASPDAC
1995
ACM
15 years 10 months ago
1995
ACM
- We address the problem of transforming a behavioral specification so that synthesis of a testable implementation from the new specification requires significantly less area and ...