Sciweavers

2086 search results - page 182 / 418
» Mathematical Theory Exploration
Sort
View
ATAL
2006
Springer
15 years 7 months ago
Symbolic negotiation revisited
In this paper we propose a formalism for symbolic negotiation. We regard symbolic negotiation as cooperative problem solving (CPS), which is based on symbolic reasoning and is ext...
Peep Küngas, Mihhail Matskin
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 7 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
15 years 7 months ago
An ant-based algorithm for finding degree-constrained minimum spanning tree
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
Thang Nguyen Bui, Catherine M. Zrncic
ECAL
1995
Springer
15 years 7 months ago
Contextual Genetic Algorithms: Evolving Developmental Rules
A genetic algorithm scheme with a stochastic genotype/phenotype relation is proposed. The mechanisms responsible for this intermediate level of uncertainty, are inspired by the bio...
Luis Mateus Rocha
AISB
2008
Springer
15 years 6 months ago
Substitution for Fraenkel-Mostowski foundations
Abstract. A fundamental and unanalysed logical concept is substitution. This seemingly innocuous operation -- substituting a variable for a term or valuating a variable to an eleme...
Murdoch Gabbay, Michael Gabbay