1650 search results - page 224 / 330 » The HOM problem is decidable |
163
click to vote
ICCAD
2010
IEEE
15 years 4 months ago
2010
IEEE
In 3D integrated circuits through silicon vias (TSVs) are used to connect different dies stacked on top of each other. These TSV occupy silicon area and have significantly larger a...
212
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
178
click to vote
IFIP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
192
click to vote
IJACTAICIT
2010
15 years 1 months ago
2010
It is great practical interest to decide when to stop testing a software system in development phase and transfer it to the user. This problem is called as the optimal software re...
184
click to vote
COR
2011
15 years 26 days ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...