1071 search results - page 45 / 215 » Programming with enumerable sets of structures |
100
click to vote
GRC
2007
IEEE
15 years 8 months ago
2007
IEEE
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
132
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
149
click to vote
STACS
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
133
click to vote
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
110
click to vote
AAAI
2007
15 years 4 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...