10997 search results - page 17 / 2200 » On the Structure of Complete Sets |
MOC
1998
13 years 8 months ago
1998
We give bounds for the coefficients of a polynomial as functions of the diameter of its roots, hence we obtain polynomials with minimal diameters and small degree
JSSPP
2010
Springer
13 years 6 months ago
2010
Springer
AIPS
2008
13 years 11 months ago
2008
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
ICOIN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
ICWE
2007
Springer
14 years 2 months ago
2007
Springer
Combining expressiveness and plainness in the design of web documents is a difficult task. Validation languages are very powerful and designers are tempted to over-design specific...