Sciweavers

10 search results - page 2 / 2
» Q'tron Neural Networks for Constraint Satisfaction
Sort
View
SCHEDULING
2010
60views more  SCHEDULING 2010»
13 years 3 months ago
An improved constraint satisfaction adaptive neural network for job-shop scheduling
Shengxiang Yang, Dingwei Wang, Tianyou Chai, Graha...
WWW
2008
ACM
14 years 5 months ago
Integrating the IAC neural network in ontology mapping
Ontology mapping seeks to find semantic correspondences between similar elements of different ontologies. This paper proposes a neural network based approach to search for a globa...
Ming Mao, Yefei Peng, Michael Spring
NPL
1998
87views more  NPL 1998»
13 years 4 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
IJCNN
2006
IEEE
13 years 11 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
ISNN
2005
Springer
13 years 10 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu