Numerical Results for Small Graph Instances
Improving bounds on large instances of graph coloring
... 1: Results for the web, biological and infrastructure graphs Let’s divide our analysis over the different ...other instances that have the same lower and upper bound consistently, this is probably due to ...
18
Graph based classification for detecting instances of bug patterns
... the results of our experiments in detecting Null Pointer Exceptions in Java ...evaluation results are promising and confirm that machine learning can help improve code security and develop better bug finder ...
81
Graph construction based on labeled instances for semi-supervised learning
... the graph generation methods are to this input ...these results we observe that kNN method usually leads to good results for values of k smaller than 10, because higher values of k turn the ...
7
Weakly Supervised Acquisition of Labeled Class Instances using Graph Random Walks
... of instances, we chose 100 random instances from the A8 results to compare to the top 100 instances produced by ...the results against actual documents. Results from these ...
9
Small cycles in the Pancake graph
... reversals C l = r i 0 . . . r i l−1 , where 2 6 i j 6 n, and i j 6= i j+1 for any 0 6 j 6 l − 1, such that πr i 0 . . . r i l−1 = π, where π ∈ Sym n , is called a form of a cycle C l of length l. A cycle C l of length l ...
10
1 For Amazon EC2 instances, m1.small type equips with 1.7
... are results from Amazon and Rackspace ...powerful instances when workload is ...has small variance val- ues, the average RP in this case increases to ...
12
Numerical evidence for phase transitions of NP complete problems for instances drawn from Lévy stable distributions
... Using this idea, a cut-set heuristic is added to Culberson and Vandegriend’s algorithm and is used as a test to find graphs for which no Hamiltonian Cycle can occur. Graphs are initially filtered through the cut-set ...
139
Clique cover and graph separation : new incompressibility results
... represent instances of the ...malformed instances into one equivalence class, and the corresponding cross-composition outputs a trivial NO-instance, given a sequence of malformed ...
21
Graph-based analysis and visualization of experimental results with ONDEX
... When comparing ONDEX with dedicated microarray analysis tools like Acuity, GeneSpring and Spotfire DecisionSite for Microarray Analysis, the difference is that these tools provide comprehensive statistical support and ...
9
WORST CASE INSTANCES ARE FRAGILE
... directed graph with non-negative edge costs, a source node s, and a desig- nated subset T of target nodes, the task is to compute a shortest path from s to a node in T ...random instances, we observed an ...
125
4 Numerical Results
... [17] Voller V R, Development and application of a heat balance integral method for analysis of metallurgical solodification..[r] ...
6
New Results on Labelings of Central Graph of Barbell Graph
... obtained by subdividing each edge of B(p, n) exactly once and joining all the non adjacent vertices of B(p, n). In this paper, the ways to construct root mean square, square sum, square difference, cordial, total cordial ...
9
4 Numerical Results and Discussion
... Published on line: 1 December 2018 Abstract A mathematical model is presented to investigate the dynamics of a pre- stressed piezoelectric plate-strip resting on a rigid foundation, under the action of a time- harmonic ...
13
theoretical aspects and numerical results
... Chapter 6 Conclusions and Outlook The main aim of this work was to obtain an approximate solution of the seismic traveltime tomography problems with the help of splines based on reproducing kernel Sobolev spaces. It was ...
153
Structural and extremal results in graph theory
... Results about the size and structure of matchings in graphs are well ...a graph represents a chemical structure, matchings can represent the possible placement of double ...edge-colored graph, a ...
89
THE NUMERICAL RESULTS OF DIVERSE SYSTEMS OF BREEDING
... After giving the general formula and the first few terms of the series to which it gives rise, the limiting value of the proportions is given, and this is followed[r] ...
38
SOME RESULTS ON TOTAL CHROMATIC NUMBER OF A GRAPH
... a graph is a proper coloring in which no two adjacent or incident graph elements receive the same ...a graph is the smallest positive integer for which the graph admits a total ...some ...
5
The small intersection graph relative to multiplication modules
... the small intersection graph G(M ) of M with all non-small proper submodules of M as vertices and two distinct vertices N, K are adjacent if and only if N ∩ K is a non-small sub- module of M ...
12
Design Patterns Instances
... pattern instances Another equally important activity concerning the design patterns is recognition of their instances in the existing ...patterns instances in the code increases the risk of these ...
9
Weak Instances of PLWE
... our results is that, for number fields satisfying our conditions, our attack on PLWE works by “guessing” one of q possibilities for the value of the secret polynomial evaluated at 1, and distinguishing PLWE ...
12