Sciweavers

9842 search results - page 1667 / 1969
» Compositional timing analysis
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 4 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
CORR
2010
Springer
140views Education» more  CORR 2010»
15 years 4 months ago
Dynamic Vehicle Routing for Data Gathering in Wireless Networks
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...
Güner D. Çelik, Eytan Modiano
CSDA
2010
165views more  CSDA 2010»
15 years 4 months ago
A two-component Weibull mixture to model early and late mortality in a Bayesian framework
A two component parametric mixture is proposed to model survival after an invasive treatment, when patients may experience different hazards regimes: a risk of early mortality dir...
Alessio Farcomeni, Alessandra Nardi
DATAMINE
2010
120views more  DATAMINE 2010»
15 years 4 months ago
A weighted voting summarization of SOM ensembles
Abstract Weighted Voting Superposition (WeVoS) is a novel summarization algorithm for the results of an ensemble of Self-Organizing Maps. Its principal aim is to achieve the lowest...
Bruno Baruque, Emilio Corchado
DISOPT
2010
129views more  DISOPT 2010»
15 years 4 months ago
Labeled Traveling Salesman Problems: Complexity and approximation
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
Basile Couëtoux, Laurent Gourvès, J&ea...
« Prev « First page 1667 / 1969 Last » Next »