1097 search results - page 118 / 220 » Testing Graph Isomorphism |
103
Voted
CEC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
114
click to vote
PASTE
1998
ACM
15 years 6 months ago
1998
ACM
Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing met...
132
click to vote
PRICAI
1998
Springer
15 years 6 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
113
click to vote
ESOP
2000
Springer
15 years 6 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
141
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...