10608 search results - page 366 / 2122 » Complexity of O'Hara's Algorithm |
ICDAR
1999
IEEE
15 years 5 months ago
1999
IEEE
This paper presents part of a new DIA performance analysis framework aimed at Layout Analysis algorithm developers. A new region-representation scheme (an interval-based descripti...
106
Voted
ATS
1997
IEEE
15 years 5 months ago
1997
IEEE
Testing circuits which do not include a global reset signal requires either complex ATPG algorithms based on 9- or even 256-valued algebras, or some suitable method to generate in...
111
click to vote
CONPAR
1992
15 years 4 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
115
Voted
PPSN
1998
Springer
15 years 4 months ago
1998
Springer
The production of specimen for microsystems or microcomponents is both, time and material-consuming. In a traditional design process the number of possible variations which can be ...
109
Voted
PATAT
1995
Springer
15 years 4 months ago
1995
Springer
The scheduling of exams in institutions of higher education is known to be a highly constrained problem. The advent of modularity in many institutions in the UK has resulted in a s...