6110 search results - page 223 / 1222 » Approximate Computing |
171
click to vote
EOR
2006
15 years 6 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
157
click to vote
COLING
2002
15 years 6 months ago
2002
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
160
click to vote
MP
2002
15 years 6 months ago
2002
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
179
click to vote
FORTE
2009
15 years 4 months ago
2009
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
175
click to vote
TVCG
2012
13 years 9 months ago
2012
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...