1127 search results - page 65 / 226 » Testing the Expansion of a Graph |
AAAI
2010
14 years 11 months ago
2010
Dominance testing, the problem of determining whether an outcome is preferred over another, is of fundamental importance in many applications. Hence, there is a need for algorithm...
110
click to vote
BMCBI
2008
14 years 10 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
EURODAC
1990
IEEE
15 years 1 months ago
1990
IEEE
In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The ...