Sciweavers

513 search results - page 69 / 103
» Finitely Based, Finite Sets of Words
Sort
View
NCA
2008
IEEE
14 years 11 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
SIAMSC
2008
167views more  SIAMSC 2008»
14 years 11 months ago
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...
Moody T. Chu, Matthew M. Lin
JLP
2010
85views more  JLP 2010»
14 years 6 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
CGI
1998
IEEE
15 years 4 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
KR
1992
Springer
15 years 3 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder