1525 search results - page 135 / 305 » Matching with Regular Constraints |
146
Voted
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
151
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
126
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
Resource scheduling in large-scale, volatile desktop grids is challenging because resource state is both dynamic and eclectic. Matching available resources with requests is not al...
133
click to vote
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
178
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...