Sciweavers

1760 search results - page 79 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
TDMA Scheduling in Long-Distance WiFi Networks
—In the last few years, long-distance WiFi networks have been used to provide Internet connectivity in rural areas. The strong requirement to support real-time applications in th...
Debmalya Panigrahi, Bhaskaran Raman
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 10 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
PODS
2003
ACM
114views Database» more  PODS 2003»
16 years 4 months ago
Soft stratification for magic set based query evaluation in deductive databases
In this paper we propose a new bottom-up query evaluation method for stratified deductive databases based on the Magic Set approach. As the Magic Sets rewriting may lead to unstra...
Andreas Behrend
LPNMR
2009
Springer
15 years 9 months ago
HAPLO-ASP: Haplotype Inference Using Answer Set Programming
Identifying maternal and paternal inheritance is essential to be able to find the set of genes responsible for a particular disease. However, due to technological limitations, we ...
Esra Erdem, Ozan Erdem, Ferhan Türe
IJCAI
1993
15 years 5 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi