11740 search results - page 115 / 2348 » More Problems in Rewriting |
120
Voted
CP
1999
Springer
15 years 5 months ago
1999
Springer
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
75
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
80
Voted
COR
2008
15 years 26 days ago
2008
In many realistic situations, a job processed later consumes more time than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. However, job...
87
Voted
DAM
2010
15 years 25 days ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
CORR
2007
Springer
15 years 22 days ago
2007
Springer
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...