4126 search results - page 441 / 826 » Relationships with other Formalisms |
199
click to vote
TOG
2008
15 years 6 months ago
2008
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
159
click to vote
JNCA
2007
15 years 6 months ago
2007
An approach for detecting feature interactions in IETF’s Call Processing Language (CPL) scripts is presented. The approach is logic based in the sense that it uses a logic repre...
171
click to vote
CI
2004
15 years 6 months ago
2004
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
152
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
144
click to vote
ENTCS
2002
15 years 6 months ago
2002
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...