1431 search results - page 212 / 287 » Solving Constraints in Model Transformations |
114
Voted
TR
2008
15 years 14 days ago
2008
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
113
Voted
TVLSI
1998
15 years 7 days ago
1998
Abstract—We introduce a technique for on-line built-in selftesting (BIST) of bus-based field programmable gate arrays (FPGA’s). This system detects deviations from the intende...
102
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
103
click to vote
JMLR
2006
15 years 16 days ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
105
click to vote
ENTCS
2007
15 years 16 days ago
2007
Symbolic model checking is PSPACE complete. Since QBF is the standard PSPACE complete problem, it is most natural to encode symbolic model checking problems as QBF formulas and th...