Sciweavers

1933 search results - page 203 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
15 years 9 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter
AAAI
2006
15 years 5 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 4 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
ICUMT
2009
15 years 2 months ago
Joint power control, scheduling and routing for multicast in multihop energy harvesting sensor networks
We consider the problem of joint power control, scheduling and routing in energy harvesting sensor networks allowing for multicast of data generated at the sensor nodes to a set of...
Vinay Joseph, Vinod Sharma, Utpal Mukherji, Manjun...
CEC
2010
IEEE
15 years 5 months ago
Adaptive learning particle swarm optimizer-II for global optimization
This paper presents an updated version of the adaptive learning particle swarm optimizer (ALPSO) [6], we call it ALPSO-II. In order to improve the performance of ALPSO on multi-mod...
Changhe Li, Shengxiang Yang