2477 search results - page 9 / 496 » Approximate extended formulations |
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
SODA
1997
ACM
13 years 8 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
SIAMSC
2008
13 years 7 months ago
2008
We propose a new numerical scheme for linear transport equations. It is based on a decomposition of the distribution function into equilibrium and non-equilibrium parts. We also us...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...