10072 search results - page 1409 / 2015 » Composition of Model Programs |
278
click to vote
CPAIOR
2010
Springer
15 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
233
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
There is building interest in using FPGAs as accelerators for high-performance computing, but existing systems for programming them are so far inadequate. In this paper we propose...
291
click to vote
ISOLA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The Implicit Path Enumeration Technique (IPET) has become widely accepted as a powerful technique to compute upper bounds on the Worst-Case Execution Time (WCET) of time-...
216
click to vote
CACM
2010
15 years 4 months ago
2010
We present Goldilocks, a Java runtime that monitors program executions and throws a DataRaceException when a data race is about to occur. This prevents racy accesses from taking p...
192
Voted
COGSR
2011
15 years 2 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...