11371 search results - page 91 / 2275 » The network inhibition problem |
147
click to vote
ORL
2008
15 years 6 months ago
2008
Consider the problem of maximizing the toll revenue collected on a multi-commodity transportation network. This fits a bilevel framework where a leader sets tolls, while users res...
144
click to vote
FMCO
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixe...
165
click to vote
AMAI
1999
Springer
15 years 6 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
182
click to vote
IPL
2002
15 years 6 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
150
click to vote
IPL
2007
15 years 6 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...