13987 search results - page 122 / 2798 » The Two Guards Problem |
115
click to vote
EVOW
2005
Springer
15 years 9 months ago
2005
Springer
We show how an evolutionary algorithm can successfully be used to evolve a set of difficult to solve symmetric travelling salesman problem instances for two variants of the Lin-Ker...
115
click to vote
ASPDAC
2001
ACM
15 years 7 months ago
2001
ACM
Abstract- Traditional state-traversal-basedmethods for verifying sequential circuits are computationally infeasible for circuits with a large number of memory elements. However, if...
116
click to vote
BMVC
1997
15 years 4 months ago
1997
A new geometrical approach in solving the shape from shading problem of Lambertian model is discussed. It is shown that this problem is bound by two local constraints through the ...
124
click to vote
STOC
1997
ACM
15 years 7 months ago
1997
ACM
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
JSYML
2008
15 years 3 months ago
2008
Some 40 years ago, Dana Scott proved that every countable Scott set is the standard system of a model of PA. Two decades later, Knight and