4498 search results - page 449 / 900 » How to Invent Functions |
181
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
178
click to vote
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
185
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Rapid design space exploration with accurate models is necessary to improve designer productivity at the electronic system level. We describe how to use a new event-based design f...
179
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
166
click to vote
HOST
2009
IEEE
16 years 1 months ago
2009
IEEE
—Outsourcing the fabrication of semiconductor devices to merchant foundries raises some issues concerning the IP protection of the design. Active hardware metering schemes try to...