729 search results - page 91 / 146 » Solving subgraph isomorphism problems with constraint progra... |
134
click to vote
VLSID
1999
IEEE
15 years 8 months ago
1999
IEEE
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
147
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
133
click to vote
RTSS
1998
IEEE
15 years 8 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
148
click to vote
ESA
2000
Springer
15 years 7 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...
153
click to vote
AGP
1996
IEEE
15 years 8 months ago
1996
IEEE
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...