14386 search results - page 298 / 2878 » The Chinese Generals Problem |
136
click to vote
CCE
2004
15 years 4 months ago
2004
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
139
click to vote
INDIASE
2009
ACM
15 years 11 months ago
2009
ACM
A software architect engages in solving Software Engineering (SE) problems throughout his career. Thus inculcating problem solving skills should be one of the learning objectives ...
173
Voted
CSR
2007
Springer
15 years 11 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...
130
click to vote
AIMSA
2004
Springer
15 years 10 months ago
2004
Springer
Nowadays, many real problem in Artificial Intelligence can be modeled as constraint satisfaction problems (CSPs). A general rule in constraint satisfaction is to tackle the hardes...
121
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
We consider the problem of deciding whether a polygonal knot in 3dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that...