Sciweavers

989 search results - page 17 / 198
» HowNet and Its Computation of Meaning
Sort
View
ISCC
2005
IEEE
15 years 3 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 1 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
SMC
2010
IEEE
202views Control Systems» more  SMC 2010»
14 years 7 months ago
Evaluating the performance of nonnegative matrix factorization for constructing semantic spaces: Comparison to latent semantic a
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
Akira Utsumi
EURODAC
1995
IEEE
136views VHDL» more  EURODAC 1995»
15 years 1 months ago
Computing subsets of equivalence classes for large FSMs
Computing equivalence classes for FSMs has several applications to synthesis and veri cation problems. Symbolic traversal techniques are applicable to medium-small circuits. This ...
Gianpiero Cabodi, Stefano Quer, Paolo Camurati
65
Voted
ATAL
2003
Springer
15 years 2 months ago
A Dialectic Architecture for Computational Autonomy
This paper takes the view that to be considered autonomous, a software agent must possess the means by which to manage its own motivations and so define new goals. Using the motiva...
Mark Witkowski, Kostas Stathis