2150 search results - page 215 / 430 » On a restricted cross-intersection problem |
154
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
132
click to vote
ESA
2006
Springer
15 years 7 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
154
click to vote
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We study the synthesis problem for external linear or branching specifications and distributed, synchronous architectures with arbitrary delays on processes. External mea...
152
click to vote
AMAI
2000
Springer
15 years 7 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
145
Voted
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...