154 search results - page 29 / 31 » cpc 2008 |
CPC
2007
13 years 7 months ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
CPC
1999
13 years 7 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
In Software Product Lines (SPLs), product configuration is a decision-making process in which a group of stakeholders choose features for a product. Unfortunately, current configu...
CPHYSICS
2008
13 years 7 months ago
2008
We present a Fortran program to compute the distribution of dipole moments of free particles for use in analyzing molecular beams experiments that measure moments by deflection in...
CPHYSICS
2008
13 years 7 months ago
2008
We present wannier90, a program for calculating maximally-localised Wannier functions (MLWF) from a set of Bloch energy bands that may or may not be attached to or mixed with othe...