Sciweavers

3136 search results - page 272 / 628
» Genetic programming theory
Sort
View
AGP
1997
IEEE
15 years 10 months ago
An Algorithm for Learning Abductive Rules
We propose an algorithm for learning abductive logic programs from examples. We consider the Abductive Concept Learning framework, an extension of the Inductive Logic Programming ...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
ALC
1997
15 years 7 months ago
Synthesising interconnections
In the context of the modular and incremental development of complex systems, viewed as interconnections of interacting components, new dimensions and new problems arise in the ca...
José Luiz Fiadeiro, Antónia Lopes, T...
GPCE
2008
Springer
15 years 7 months ago
Typing communicating component assemblages
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
15 years 4 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
PADL
2012
Springer
14 years 1 months ago
Recent Advances in Declarative Networking
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
Boon Thau Loo, Harjot Gill, Changbin Liu, Yun Mao,...