3268 search results - page 293 / 654 » The hub number of a graph |
173
click to vote
AIPS
2000
15 years 8 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
162
Voted
DAWAK
2010
Springer
15 years 7 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
195
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
192
Voted
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
187
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Physical wave fields are often described by means of a vector field. Advances in sensor technology enable us to collect an increasing number of measurement at the same location ...