4171 search results - page 20 / 835 » Choice numbers of graphs |
AIPS
2000
13 years 9 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...
BROADNETS
2006
IEEE
14 years 7 days ago
2006
IEEE
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
HT
1999
ACM
14 years 24 days ago
1999
ACM
When the utility of a hypertext system depends on the number of users and amount of data in the system, the system exhibits network effects. This paper examines how the core diffe...
JCST
2010
13 years 7 months ago
2010
In the Bayesian mixture modeling framework it is possible to infer the necessary number of components to model the data and therefore it is unnecessary to explicitly restrict the n...
JCT
2007
13 years 8 months ago
2007
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...