920 search results - page 99 / 184 » Generating Satisfiable Problem Instances |
126
click to vote
FMICS
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
106
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Calibrating an evolutionary algorithm (EA) means finding the right values of algorithm parameters for a given problem. This issue is highly relevant, because it has a high imp...
113
Voted
CP
2011
Springer
14 years 15 days ago
2011
Springer
Algorithm portfolios aim to increase the robustness of our ability to solve problems efficiently. While recently proposed algorithm selection methods come ever closer to identifyin...
121
Voted
JACM
2010
14 years 7 months ago
2010
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Most FPGA technology mapping approaches either target Lookup Tables (LUTs) or relatively simple Programmable Logic Blocks (PLBs). Considering networks of PLBs during technology map...