4218 search results - page 405 / 844 » Complete sets of cooperations |
188
click to vote
LPNMR
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to exten...
187
click to vote
SEMWEB
2009
Springer
16 years 2 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
191
click to vote
ACSC
2007
IEEE
16 years 2 months ago
2007
IEEE
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
208
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— For the past decade or so, evolutionary multiobjective optimization (EMO) methodologies have earned wide popularity for solving complex practical optimization problems,...
192
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...