7961 search results - page 1041 / 1593 » Input-Output Model Programs |
172
click to vote
IPCO
2001
15 years 8 months ago
2001
We investigate network design under volatile conditions of link failures and traffic overload. Our model is a non-simultaneous 2-commodity problem. We characterize the feasible so...
181
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Integer factorization is a very hard computational problem. Currently no ecient algorithm for integer factorization is publicly known. However, this is an important probl...
168
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
: Cloud infrastructures enable the efficient parallel execution of data-intensive tasks such as entity resolution on large datasets. We investigate challenges and possible solution...
173
click to vote
EOR
2010
15 years 7 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
164
Voted
ENTCS
2006
15 years 7 months ago
2006
This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible ...