Sciweavers

3221 search results - page 145 / 645
» Termination of Linear Programs
Sort
View
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
14 years 2 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...
André Leier, Wolfgang Banzhaf
BMCBI
2008
78views more  BMCBI 2008»
13 years 9 months ago
A new protein linear motif benchmark for multiple sequence alignment software
Background: Linear motifs (LMs) are abundant short regulatory sites used for modulating the functions of many eukaryotic proteins. They play important roles in post-translational ...
Emmanuel Perrodou, Claudia Chica, Olivier Poch, To...
ICALP
2005
Springer
14 years 3 months ago
Up-to Techniques for Weak Bisimulation
Abstract. We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields ...
Damien Pous
LPAR
1999
Springer
14 years 1 months ago
Extensions to the Estimation Calculus
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...
Jeremy Gow, Alan Bundy, Ian Green
CLIMA
2004
13 years 11 months ago
A Computational Model for Conversation Policies for Agent Communication
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
Jamal Bentahar, Bernard Moulin, John-Jules Ch. Mey...