368 search results - page 47 / 74 » Sphere Methods for LP |
115
click to vote
ISITA
2010
14 years 11 months ago
2010
In this paper we propose a modication of the Hopeld neural networks for vector precoding, based on Lenstra, Lenstra, and Lov`asz lattice basis reduction. This precoding algorithm c...
110
click to vote
WWW
2004
ACM
16 years 2 months ago
2004
ACM
Dividing web pages into fragments has been shown to provide significant benefits for both content generation and caching. In order for a web site to use fragment-based content gen...
118
click to vote
ISQED
2009
IEEE
15 years 8 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...
164
click to vote
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
121
click to vote
COLING
1992
15 years 3 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...