4131 search results - page 248 / 827 » The Generalized Max-Controlled Set Problem |
113
click to vote
IPL
2008
15 years 4 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
140
Voted
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
156
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
162
click to vote
SIGECOM
2010
ACM
15 years 9 months ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
167
click to vote
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...