Sciweavers

144 search results - page 29 / 29
» New approaches to covering and packing problems
Sort
View
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
13 years 10 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
SEMWEB
2005
Springer
13 years 10 months ago
Modeling Degrees of Conceptual Overlap in Semantic Web Ontologies
Information retrieval systems have to deal with uncertain knowledge and query results should reflect this uncertainty in some manner. However, Semantic Web ontologies are based on...
Markus Holi, Eero Hyvönen
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
13 years 9 months ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
BMCBI
2008
104views more  BMCBI 2008»
13 years 4 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...