4118 search results - page 331 / 824 » Efficient Algorithms for Airline Problem |
141
click to vote
JACM
1998
15 years 4 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
145
click to vote
IMECS
2007
15 years 6 months ago
2007
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
227
click to vote
VLDB
2005
ACM
16 years 5 months ago
2005
ACM
Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, t...
134
Voted
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
– With the popularity of Multiple Power Domain (MPD) design, the multi-domain power network noise analysis and minimization is becoming important. This paper describes an efficie...
166
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...