7106 search results - page 299 / 1422 » Restricted Complexity, General Complexity |
144
click to vote
CP
1998
Springer
15 years 9 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
150
click to vote
ASPDAC
2008
ACM
15 years 6 months ago
2008
ACM
Nowadays many customised embedded processors offer the possibility of speeding up an application by implementing it using Application-Specific Functional units (AFUs). However, th...
107
click to vote
NIPS
2003
15 years 6 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
139
click to vote
ACL
1998
15 years 6 months ago
1998
The Natural Language Understanding Engine Test Environment (ETE) is a GUI software tool that aids in the development and maintenance of large, modular, natural language understand...
140
click to vote
FSTTCS
2010
Springer
15 years 2 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...