168 search results - page 30 / 34 » New upper bounds on the decomposability of planar graphs |
ATMOS
2010
14 years 8 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
103
Voted
DAC
2004
ACM
15 years 10 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
79
Voted
QEST
2008
IEEE
15 years 3 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
AAAI
1996
14 years 11 months ago
1996
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...