Sciweavers

3471 search results - page 124 / 695
» Obstacle Numbers of Graphs
Sort
View
DM
2008
112views more  DM 2008»
13 years 9 months ago
Coloring the Cartesian sum of graphs
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
Daphne Der-Fen Liu, Xuding Zhu
CEC
2005
IEEE
13 years 11 months ago
Heterogeneous multiprocessor scheduling with differential evolution
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
Krzysztof Rzadca, Franciszek Seredynski
RSA
2006
81views more  RSA 2006»
13 years 9 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
COMBINATORICA
2007
92views more  COMBINATORICA 2007»
13 years 9 months ago
Codes And Xor Graph Products
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...
Noga Alon, Eyal Lubetzky
ACNS
2010
Springer
145views Cryptology» more  ACNS 2010»
14 years 29 days ago
A Hybrid Method to Detect Deflation Fraud in Cost-Per-Action Online Advertising
Abstract. Web advertisers prefer the cost-per-action (CPA) advertisement model whereby an advertiser pays a web publisher according to the actual amount of transactions, rather tha...
Xuhua Ding