1729 search results - page 339 / 346 » On Bounds for the k-Partitioning of Graphs |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
127
click to vote
CPM
2004
Springer
15 years 3 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...