Sciweavers

4255 search results - page 26 / 851
» Cover
Sort
View
DAM
2006
191views more  DAM 2006»
13 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
COR
2007
112views more  COR 2007»
13 years 7 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
JPDC
2006
148views more  JPDC 2006»
13 years 7 months ago
Efficient algorithm for placing a given number of base stations to cover a convex region
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
Gautam K. Das, Sandip Das, Subhas C. Nandy, Bhaban...
FUIN
2007
85views more  FUIN 2007»
13 years 7 months ago
Entropies and Co-Entropies of Coverings with Application to Incomplete Information Systems
Different generalizations to the case of coverings of the standard approach to entropy applied to partitions of a finite universe X are explored. In the first approach any cover...
Daniela Bianucci, Gianpiero Cattaneo, Davide Ciucc...
JWSR
2007
89views more  JWSR 2007»
13 years 7 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...