2412 search results - page 88 / 483 » Which Problems Have Strongly Exponential Complexity |
151
click to vote
JCSS
2010
15 years 1 months ago
2010
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
119
click to vote
WEA
2007
Springer
15 years 9 months ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
213
Voted
ICDE
2007
IEEE
16 years 4 months ago
2007
IEEE
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
165
Voted
DISOPT
2011
14 years 10 months ago
2011
SAT and MAX SAT are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the...
138
click to vote
EDCC
2008
Springer
15 years 5 months ago
2008
Springer
This work addresses the problem of software fault diagnosis in complex safety critical software systems. The transient manifestations of software faults represent a challenging is...