Sciweavers

9842 search results - page 439 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
AMW
2011
14 years 10 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
HAIS
2011
Springer
14 years 9 months ago
Interval Type-2 Fuzzy Modelling and Simulated Annealing for Real-World Inventory Management
The modelling of real-world complex systems is an area of ongoing interest for the research community. Real-world systems present a variety of challenges not least of which is the ...
Simon Miller, Mario A. Góngora, Robert John
CORR
2012
Springer
174views Education» more  CORR 2012»
14 years 2 months ago
Partial Searchlight Scheduling is Strongly PSPACE-complete
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...
Giovanni Viglietta
ACL
2012
13 years 8 months ago
Polarity Consistency Checking for Sentiment Dictionaries
Polarity classification of words is important for applications such as Opinion Mining and Sentiment Analysis. A number of sentiment word/sense dictionaries have been manually or ...
Eduard C. Dragut, Hong Wang, Clement T. Yu, A. Pra...
SPATIALCOGNITION
2000
Springer
15 years 9 months ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen