Sciweavers

8810 search results - page 371 / 1762
» Openness
Sort
View
LATIN
2010
Springer
15 years 5 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
LPAR
2010
Springer
15 years 5 months ago
Aligators for Arrays (Tool Paper)
This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out i...
Thomas A. Henzinger, Thibaud Hottelier, Laura Kov&...
ACL
2010
15 years 4 months ago
On the Computational Complexity of Dominance Links in Grammatical Formalisms
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multiset-valued linear indexed grammars (MLIGs) by Rambow (19...
Sylvain Schmitz
IAT
2010
IEEE
15 years 4 months ago
A Framework for Developing Agent-Based Distributed Applications
Abstract--The development of large-scale distributed multiagent systems in open dynamic environments is a challenge. System behavior is often not predictable and can only be evalua...
Michel Oey, Sander van Splunter, Elth Ogston, Mart...
NAACL
2010
15 years 4 months ago
Query Ambiguity Revisited: Clickthrough Measures for Distinguishing Informational and Ambiguous Queries
Understanding query ambiguity in web search remains an important open problem. In this paper we reexamine query ambiguity by analyzing the result clickthrough data. Previously pro...
Yu Wang, Eugene Agichtein