Sciweavers

666 search results - page 77 / 134
» The Pipelined Set Cover Problem
Sort
View
NETWORKS
2011
13 years 5 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
CPAIOR
2011
Springer
13 years 1 months ago
Manipulating MDD Relaxations for Combinatorial Optimization
Abstract. We study the application of limited-width MDDs (multivalued decision diagrams) as discrete relaxations for combinatorial optimization problems. These relaxations are used...
David Bergman, Willem Jan van Hoeve, John N. Hooke...
SEMWEB
2009
Springer
14 years 4 months ago
Graph-Based Ontology Construction from Heterogenous Evidences
Abstract. Ontologies are tools for describing and structuring knowledge, with many applications in searching and analyzing complex knowledge bases. Since building them manually is ...
Christoph Böhm, Philip Groth, Ulf Leser
ALGOSENSORS
2007
Springer
14 years 2 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
WWW
2007
ACM
14 years 11 months ago
The discoverability of the web
Previous studies have highlighted the high arrival rate of new content on the web. We study the extent to which this new content can be efficiently discovered by a crawler. Our st...
Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christ...