273 search results - page 5 / 55 » Can Pure Cutting Plane Algorithms Work |
124
Voted
ECRTS
2008
IEEE
15 years 10 months ago
2008
IEEE
T-N Plane Abstraction (E-TNPA) proposed in this paper realizes work-conserving and efficient optimal real-time scheduling on multiprocessors relative to the original T-N Plane Ab...
134
Voted
IOR
2006
15 years 3 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
120
Voted
CVPR
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
130
Voted
RTA
2005
Springer
15 years 9 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
130
Voted
PASTE
2010
ACM
15 years 5 months ago
2010
ACM
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...