121 search results - page 11 / 25 » Optimizing polynomials for floating-point implementation |
81
Voted
WSC
2007
15 years 2 months ago
2007
We consider the problem of selecting the best system using simulation-based ordinal optimization. This problem has been studied mostly in the context of light-tailed distributions...
126
click to vote
CSC
2009
15 years 1 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
77
Voted
CSDA
2008
15 years 15 days ago
2008
We discuss optimal design problems for a popular method of series estimation in regression problems. Commonly used design criteria are based on the generalized variance of the est...
104
Voted
TON
2008
14 years 12 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
106
click to vote
CAP
2010
14 years 7 months ago
2010
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...