Sciweavers

6740 search results - page 314 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
COR
2008
118views more  COR 2008»
15 years 4 months ago
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
In this paper, an improved Two-Stage Simulated Annealing algorithm is presented for the Minimum Linear Arrangement Problem for Graphs. This algorithm integrates several distinguis...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CORR
2008
Springer
130views Education» more  CORR 2008»
15 years 4 months ago
A Kernel Method for the Two-Sample Problem
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
Arthur Gretton, Karsten M. Borgwardt, Malte J. Ras...
HIS
2009
15 years 1 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
KDD
2006
ACM
381views Data Mining» more  KDD 2006»
16 years 4 months ago
GPLAG: detection of software plagiarism by program dependence graph analysis
Along with the blossom of open source projects comes the convenience for software plagiarism. A company, if less self-disciplined, may be tempted to plagiarize some open source pr...
Chao Liu 0001, Chen Chen, Jiawei Han, Philip S. Yu
ICALP
2009
Springer
16 years 4 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...