663 search results - page 108 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
153
Voted
SIAMJO
2010
14 years 10 months ago
2010
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
178
Voted
WEA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
119
Voted
WAOA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
172
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
High-end computing is universally recognized to be a strategic tool for leadership in science and technology. A significant portion of high-end computing is conducted on clusters...
132
Voted
CCO
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The first computer implementation of the Dantzig-FulkersonJohnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequa...