2297 search results - page 38 / 460 » Production of Large Computer Programs |
ORL
2011
13 years 2 months ago
2011
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
HIPC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
EJC
2011
12 years 11 months ago
2011
We provide a new proof of Brylawski’s formula for the Tutte polynomial of the tensor product of two matroids. Our proof involves extending Tutte’s formula, expressing the Tutte...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...