Sciweavers

14158 search results - page 317 / 2832
» Generalized switch-setting problems
Sort
View
CORR
2011
Springer
160views Education» more  CORR 2011»
14 years 11 months ago
When is social computation better than the sum of its parts?
good solutions to complex problems. In many examples, individuals trying to solve superior global solution. This suggests that there may be general principles of information aggre...
Vadas Gintautas, Aric A. Hagberg, Luís M. A...
GLOBECOM
2010
IEEE
15 years 2 months ago
Sliding Mode Based Joint Congestion Control and Scheduling in Multi-Hop Ad Hoc Networks with Multi-Class Services
In this paper, we consider the joint problem of congestion control and scheduling with multi-class Quality of Service (QoS) requirements. Generally, the joint problem is formulated...
Zongrui Ding, Dapeng Wu
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 7 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
SIAMJO
2000
116views more  SIAMJO 2000»
15 years 4 months ago
Computational Experience with an Interior Point Cutting Plane Algorithm
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
John E. Mitchell
ALGORITHMICA
2010
115views more  ALGORITHMICA 2010»
15 years 4 months ago
Multi-Color Pebble Motion on Graphs
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
Gilad Goraly, Refael Hassin