2877 search results - page 411 / 576 » The Complexity of Planarity Testing |
144
click to vote
CHARME
2003
Springer
15 years 9 months ago
2003
Springer
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
124
click to vote
DAGM
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we present a real-time PCB inspection system which can detect defects including the breaks in the wires and short circuit. The proposed inspection algorithm is based...
124
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
In this paper, we revisit a general class of multi-criteria multi-constrained network design problems and attempt to solve, in a novel way, with Evolutionary Algorithms (EAs). A ma...
174
click to vote
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Complex representation in Genetic Algorithms and pattern in real problems limits the effect of crossover to construct better pattern from sporadic building blocks. Instead of intro...
146
click to vote
ICCBR
2003
Springer
15 years 9 months ago
2003
Springer
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...