Sciweavers

246 search results - page 6 / 50
» Stable domination and weight
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 9 months ago
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Matt Gibson, Imran A. Pirwani
CCR
2006
122views more  CCR 2006»
13 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ICPR
2006
IEEE
14 years 10 months ago
Adaptive Weighting of Local Classifiers by Particle Filter
This paper presents adaptive weighting method for combining local classifiers by particle filter. In recent years, the effectiveness of combination of local classifiers (features)...
Kazuhiro Hotta
ICCAD
2005
IEEE
105views Hardware» more  ICCAD 2005»
14 years 6 months ago
Weighted control scheduling
Abstract — This paper describes a practical technique for the optimal scheduling of control dominated systems minimizing the weighted average latency over all control branches. S...
Aravind Vijayakumar, Forrest Brewer
OL
2011
242views Neural Networks» more  OL 2011»
13 years 4 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...