Results 41 to 50 of about 255,219 (274)
Counterintuitive ground states in soft-core models [PDF]
, 2008 It is well known that statistical mechanics systems exhibit subtle behavior in high dimensions. In this paper, we show that certain natural soft-core models, such as the Gaussian core model, have unexpectedly complex ground states even in relatively low ...
Cohn, Henry, Kumar, Abhinav
core +1 more source
Coloring translates and homothets of a convex body [PDF]
, 2009 We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in $\RR^n$.Comment:
A. Gyárfás +14 more
core +3 more sources
Fast Parallel Fixed-Parameter Algorithms via Color Coding [PDF]
, 2015 Fixed-parameter algorithms have been successfully applied to solve numerous difficult problems within acceptable time bounds on large inputs. However, most fixed-parameter algorithms are inherently \emph{sequential} and, thus, make no use of the parallel
Bannach, Max +2 more
core +2 more sources
J@ti Undip: Jurnal Teknik Industri, 2013 Batik Saud Effendy merupakan salah satu IKM batik di Kampoeng Batik Laweyan, Surakarta. Jenis batik yang diproduksi adalah batik cap dan batik tulis dengan sebagian besar jenis batik yang diproduksi adalah batik cap.
Dyah Ika Rinawati +2 more
doaj +1 more source
, 2014 We study a variant of online bin packing, called colorful bin packing. In this problem, items that are presented one by one are to be packed into bins of size 1. Each item i has a size s_i \in [0,1] and a color c_i \in C, where C is a set of colors (that is not necessarily known in advance).
Dosa, Gyorgy, Epstein, Leah
openaire +2 more sources
Approximating Bin Packing within O(log OPT * log log OPT) bins [PDF]
, 2013 For bin packing, the input consists of n items with sizes s_1,...,s_n in [0,1] which have to be assigned to a minimum number of bins of size 1. The seminal Karmarkar-Karp algorithm from '82 produces a solution with at most OPT + O(log^2 OPT) bins.
Rothvoss, Thomas
core +1 more source
Frontiers in Plant Science, 2017 Sweet cherries are attractive fruits due to their taste, color, nutritional value, and beneficial health effects. Sweet cherry is a highly perishable fruit and all quality attributes and the level of health promoting compounds are affected by growth ...
Sofia Correia +3 more
doaj +1 more source
Subdivision into i-packings and S-packing chromatic number of some lattices [PDF]
, 2015 An $i$-packing in a graph $G$ is a set of vertices at pairwise distance greater than $i$. For a nondecreasing sequence of integers $S=(s\_{1},s\_{2},\ldots)$, the $S$-packing chromatic number of a graph $G$ is the least integer $k$ such that there exists
Gastineau, Nicolas +2 more
core +5 more sources
, 2015 We study the Colored Bin Packing Problem: we are given a set of items where each item has a weight and color. We must pack the items in bins of uniform capacity such that no two items of the same color may be adjacent within in a bin. The goal is to perform this packing using the fewest number of bins.
Alsarhan, Hamza +4 more
openaire +2 more sources
Ising formulations of many NP problems [PDF]
, 2014 We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability.
Lucas, Andrew
core +3 more sources