4814 search results - page 431 / 963 » Combining abstract interpreters |
199
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
205
click to vote
IWOMP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. With the advent of multicore- and manycore-based supercomputers, parallel programming models like MPI and OpenMP become more widely used to express various levels of para...
181
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
160
click to vote
IESS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Embedded systems are increasing in complexity, while several metrics such as time-to-market, reliability, safety and performance should be considered during the design of...
153
click to vote
RR
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...