4679 search results - page 56 / 936 » Modeling When Connections Are the Problem |
IJCAI
1993
15 years 2 months ago
1993
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
182
click to vote
ESEC
1999
Springer
15 years 5 months ago
1999
Springer
CIP is a model-based software development method for embedded systems. The problem of constructing an embedded system is decomposed into a functional and a connection problem. The ...
128
click to vote
ANOR
2005
15 years 1 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
100
click to vote
IJCNN
2006
IEEE
15 years 7 months ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
137
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A general framework for solving image inverse problems is introduced in this paper. The approach is based on Gaussian mixture models, estimated via a computationally efficient MAP...