Sciweavers

16404 search results - page 542 / 3281
» A set coverage problem
Sort
View
JCO
2007
128views more  JCO 2007»
15 years 6 months ago
Approximation algorithms and hardness results for labeled connectivity problems
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
Refael Hassin, Jérôme Monnot, Danny S...
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
PAMI
2010
122views more  PAMI 2010»
15 years 5 months ago
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
—This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available o...
Lorenzo Bruzzone, Mattia Marconcini
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 4 months ago
Solving satisfiability problems with preferences
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
MONET
2011
15 years 1 months ago
On Adaptive Density Deployment to Mitigate the Sink-Hole Problem in Mobile Sensor Networks
Abstract The use of mobile sensors is of great relevance to monitor critical areas where sensors cannot be deployed manually. The presence of data collector sinks causes increased ...
Novella Bartolini, Tiziana Calamoneri, Annalisa Ma...