305 search results - page 57 / 61 » Boosting Set Constraint Propagation for Network Design |
LATIN
2010
Springer
14 years 10 months ago
2010
Springer
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
110
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...
100
click to vote
TWC
2010
14 years 7 months ago
2010
In a conventional wireless cellular system, signal processing is performed on a per-cell basis; out-of-cell interference is treated as background noise. This paper considers the be...
143
click to vote
COR
2008
14 years 12 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
120
click to vote
WWW
2011
ACM
14 years 7 months ago
2011
ACM
The psycholinguistic theory of communication accommodation accounts for the general observation that participants in conversations tend to converge to one another’s communicativ...