4117 search results - page 121 / 824 » On the Satisfiability of Complex Constraints |
171
click to vote
FORMATS
2008
Springer
15 years 8 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
172
click to vote
ICETET
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Design of Network on chip architectures for multimedia applications is being widely studied. This involves design decisions at various levels of hierarchy. Topology des...
159
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
154
click to vote
FOIKS
2010
Springer
15 years 9 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
156
click to vote
NIPS
2000
15 years 7 months ago
2000
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...