1055 search results - page 177 / 211 » Enumerations in computable structure theory |
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Requirements Driven Agent Collaboration (RDAC) is a mechanism where the self-interested service agents actively and autonomously search for the required services submitted by the ...
JNW
2008
13 years 7 months ago
2008
Agent-based modeling, simulation, and network analysis approaches are one of the emergent techniques among soft computing literature. This paper presents an agent-based model for a...
ALIFE
2005
13 years 7 months ago
2005
We present a novel formal interpretation of dynamical hierarchies based on information theory, in which each level is a near-state-determined system, and levels are related to one ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...