Sciweavers

5090 search results - page 993 / 1018
» Constructing Strategies for Programming
Sort
View
CSL
2007
Springer
14 years 1 months ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
14 years 1 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
LOPSTR
2007
Springer
14 years 1 months ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...
OOPSLA
2007
Springer
14 years 1 months ago
Living in the comfort zone
A comfort zone is a tested region of a system’s input space within which it has been observed to behave acceptably. To keep systems operating within their comfort zones, we advo...
Martin C. Rinard