1647 search results - page 207 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
ICDCS
2007
IEEE
15 years 8 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
123
click to vote
JCO
2010
15 years 28 days ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
117
click to vote
PPSC
1997
15 years 3 months ago
1997
It seems likely that improvements in arithmetic speed will continue to outpace advances in communication bandwidth. Furthermore, as more and more problems are working on huge datas...
123
Voted
ICGI
2010
Springer
15 years 14 days ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
131
click to vote
STOC
1996
ACM
15 years 6 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...