697 search results - page 13 / 140 » A Study of Evaluation Functions for the Graph K-Coloring Pro... |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
JCT
2000
13 years 7 months ago
2000
We study discrete Green's functions and their relationship with discrete Laplace equations. Several methods for deriving Green's functions are discussed. Green's fu...
GLOBECOM
2008
IEEE
13 years 8 months ago
2008
IEEE
— Recently, establishing a VoIP call using a P2P network instead of regular SIP-servers has been proposed; this novel approach to SIP-signaling is commonly referred to as P2PSIP ...
CEC
2011
IEEE
12 years 7 months ago
2011
IEEE
Abstract—Protein structure prediction is the problem of finding the functional conformation of a protein given only its amino uence. The HP lattice model is an abstract formulat...