Sciweavers

395 search results - page 6 / 79
» Positive Versions of Polynomial Time
Sort
View
ACL
2009
14 years 7 months ago
A Polynomial-Time Parsing Algorithm for TT-MCTAG
This paper investigates the class of TreeTuple MCTAG with Shared Nodes, TTMCTAG for short, an extension of Tree Adjoining Grammars that has been proposed for natural language proc...
Laura Kallmeyer, Giorgio Satta
CSR
2010
Springer
15 years 2 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
AOR
2006
77views more  AOR 2006»
14 years 9 months ago
Preemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integratio...
Francis Sourd
TON
2008
119views more  TON 2008»
14 years 9 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
IPL
2010
107views more  IPL 2010»
14 years 8 months ago
Disjoint pattern matching and implication in strings
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
Leonid Libkin, Cristina Sirangelo