7167 search results - page 595 / 1434 » Answer Set Programming |
190
click to vote
ESOP
2010
Springer
16 years 3 months ago
2010
Springer
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
206
click to vote
HASKELL
2009
ACM
16 years 20 days ago
2009
ACM
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
176
click to vote
PLDI
2005
ACM
15 years 11 months ago
2005
ACM
Reuse of existing code from class libraries and frameworks is often difficult because APIs are complex and the client code required to use the APIs can be hard to write. We obser...
135
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
This paper describes POPE-GP, a system that makes use of the NSGA-II multiobjective evolutionary algorithm as an alternative, parameter-free technique for eliminating program bloat...
164
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...