1327 search results - page 124 / 266 » Path following algorithm for the graph matching problem |
144
Voted
ACTA
2008
15 years 4 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
127
click to vote
IJCAI
2007
15 years 5 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
141
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
111
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper investigates the path protection problem in mesh networks under multiple generic risks. Disjoint logical links may fail simultaneously if they share the same compone...
128
Voted
SEFM
2008
IEEE
15 years 10 months ago
2008
IEEE
We present an approach to find upper bounds of heap space for Java Card applets. Our method first transforms an input bytecode stream into a control flow graph (CFG), and then ...