397 search results - page 64 / 80 » Towards Polynomial Lower Bounds for Dynamic Problems |
121
click to vote
INFOCOM
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
140
Voted
SIGECOM
2006
ACM
15 years 11 months ago
2006
ACM
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
169
click to vote
IFM
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
159
click to vote
COMGEO
2012
ACM
14 years 23 days ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
148
Voted
EMSOFT
2009
Springer
15 years 9 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...