1725 search results - page 182 / 345 » Relaxed genetic programming |
142
Voted
ILC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
166
click to vote
PLDI
2011
ACM
14 years 6 months ago
2011
ACM
Current proposals for concurrent shared-memory languages, including C++ and C, provide sequential consistency only for programs without data races (the DRF guarantee). While the i...
162
Voted
SACI
2009
IEEE
15 years 10 months ago
2009
IEEE
—In the grid context, there is little support for programming paradigms such as shared data or associative programming. We have previously proposed an original idea to attack sha...
131
click to vote
MP
2006
15 years 3 months ago
2006
Determining if a solution is optimal or near optimal is fundamental in optimization theory, algorithms, and computation. For instance, Karush-Kuhn-Tucker conditions provide necessa...
108
Voted
SIAMJO
2008
15 years 3 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...