Sciweavers

1179 search results - page 178 / 236
» Programming in Hybrid Constraint Languages
Sort
View
ISCA
1998
IEEE
137views Hardware» more  ISCA 1998»
14 years 2 months ago
Accurate Indirect Branch Prediction
Indirect branch prediction is likely to become increasingly important in the future because indirect branches occur more frequently in object-oriented programs. With misprediction ...
Karel Driesen, Urs Hölzle
COR
2008
99views more  COR 2008»
13 years 10 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
EC
2008
146views ECommerce» more  EC 2008»
13 years 10 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
SIGSOFT
2008
ACM
14 years 11 months ago
Alchemy: transmuting base alloy specifications into implementations
Alloy specifications are used to define lightweight models of systems. We present Alchemy, which compiles Alloy specifications into implementations that execute against persistent...
Shriram Krishnamurthi, Kathi Fisler, Daniel J. Dou...
POPL
2001
ACM
14 years 10 months ago
Avoiding exponential explosion: generating compact verification conditions
Current verification condition (VC) generation algorithms, such as weakest preconditions, yield a VC whose size may be exponential in the size of the code fragment being checked. ...
Cormac Flanagan, James B. Saxe