555 search results - page 51 / 111 » Decompositions of Grammar Constraints |
80
Voted
ISLPED
2004
ACM
15 years 6 months ago
2004
ACM
This paper presents a technique called “workload decomposition” in which the CPU workload is decomposed in two parts: on-chip and off-chip. The on-chip workload signifies the ...
118
click to vote
PODS
2007
ACM
16 years 25 days ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
104
click to vote
ALT
2006
Springer
15 years 4 months ago
2006
Springer
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a par...
96
Voted
TAICPART
2010
IEEE
14 years 11 months ago
2010
IEEE
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
97
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...