2313 search results - page 261 / 463 » On Heuristic Time Hierarchies |
148
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
In program analysis and verification, there are some constraints that have to be processed repeatedly. A possible way to speed up the processing is to find some relations among the...
188
click to vote
CAV
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
160
click to vote
DSD
2004
IEEE
15 years 10 months ago
2004
IEEE
Loop fusion and loop shifting are well recognized loop transformations for memory requirement reduction. Stateof-the-art optimizations with loop fusion and shifting are based on h...
154
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
188
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...