Sciweavers

4131 search results - page 86 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
COMPGEOM
2004
ACM
15 years 8 months ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
ASP
2003
Springer
15 years 8 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
ICDT
2009
ACM
119views Database» more  ICDT 2009»
16 years 3 months ago
Querying data sources that export infinite sets of views
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
Bogdan Cautis, Alin Deutsch, Nicola Onose
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
15 years 8 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
129
Voted
ECSQARU
2001
Springer
15 years 7 months ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu