5506 search results - page 256 / 1102 » Minimal Logic Programs |
258
click to vote
ICFP
2009
ACM
16 years 5 months ago
2009
ACM
Functional logic programming and probabilistic programming have demonstrated the broad benefits of combining laziness (non-strict evaluation with sharing of the results) with non-...
107
click to vote
MSCS
1998
15 years 4 months ago
1998
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes, with applications to concurrency theory. The obje...
140
click to vote
SPIN
2004
Springer
15 years 9 months ago
2004
Springer
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
131
click to vote
IPCO
2010
15 years 5 months ago
2010
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
106
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...