4047 search results - page 32 / 810 » Some Properties and Some Problems on Set Functors |
IJCAI
2007
15 years 1 months ago
2007
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
JOLLI
2002
14 years 11 months ago
2002
Abstract. Relational Grammar (RG) was introduced in the 70's as a theory of grammatical relations and relation change, for example, passivization, dative shift, and raising. F...
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
CSC
2008
15 years 1 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...