4110 search results - page 56 / 822 » Efficient algorithms for the 2-gathering problem |
116
click to vote
4OR
2005
15 years 3 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
123
Voted
SODA
2000
ACM
15 years 5 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
142
click to vote
IJCSA
2007
15 years 3 months ago
2007
A large number of problems that occur in knowledge-representation, learning, VLSI-design, and other areas of artificial intelligence, are essentially satisfiability problems. The ...
113
click to vote
WSC
2008
15 years 6 months ago
2008
Assembly line balancing problem (ALBP) means assigning a series of task elements to uniform sequential stations under certain restrictions. This paper considers a special type of ...
140
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...