Sciweavers

195 search results - page 5 / 39
» Evolving by Maximizing the Number of Rules: Complexity Study
Sort
View
101
Voted
ECML
1993
Springer
15 years 1 months ago
SIA: A Supervised Inductive Algorithm with Genetic Search for Learning Attributes based Concepts
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
Gilles Venturini
CP
2008
Springer
14 years 11 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
ATAL
2004
Springer
15 years 3 months ago
Agent-Based Peer-to-Peer Service Networks: A Study of Effectiveness and Structure Evolution
We study peer-to-peer service networks consisting of autonomous agents who seek and provide services. To fulfill its local needs, an agent attempts to discover and select informa...
Yathiraj B. Udupi, Pinar Yolum, Munindar P. Singh
75
Voted
KBSE
2007
IEEE
15 years 3 months ago
Inferring structural patterns for concern traceability in evolving software
As part of the evolution of software systems, effort is often invested to discover in what parts of the source code a feature (or other concern) is implemented. Unfortunately, kn...
Barthélémy Dagenais, Silvia Breu, Fr...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 3 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...