12052 search results - page 737 / 2411 » computing 2010 |
184
click to vote
CMA
2010
15 years 4 months ago
2010
This report develops and studies a new family of NSE-regularizations, Tikhonov Leray Regularization with Time Relaxation Models. This new family of turbulence models is based on a...
189
click to vote
ENDM
2010
15 years 4 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...
199
click to vote
ENTCS
2010
15 years 4 months ago
2010
mented Abstractions Matt Eldera,1 , Denis Gopanb,2 , and Thomas Repsa,b,3 a Computer Sciences Department, Univ. of Wisconsin; Madison, WI; USA b GrammaTech, Inc.; Ithaca, NY; USA ...
180
click to vote
ENTCS
2010
15 years 4 months ago
2010
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
254
click to vote
EOR
2010
15 years 4 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...