1686 search results - page 74 / 338 » Programs as polygraphs: computability and complexity |
TACAS
2009
Springer
15 years 4 months ago
2009
Springer
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
Many optimisation problems contain substructures involving constraints on sequences of decision variables. Such constraints can be very complex to express with mixed integer progra...
ICPADS
1996
IEEE
15 years 1 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Crucial to the more widespread use of evolutionary computation techniques is the ability to scale up to handle complex problems. In the field of genetic programming, a number of d...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
— We present a novel hardware mechanism for dynamic program phase detection in distributed sharedmemory (DSM) multiprocessors. We show that successful hardware mechanisms for pha...