Sciweavers

477 search results - page 72 / 96
» Complexity Considerations, cSAT Problem Lower Bound
Sort
View
CSL
2006
Springer
13 years 11 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
JMMA
2010
90views more  JMMA 2010»
13 years 2 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
SPAA
2005
ACM
14 years 1 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
AINA
2008
IEEE
14 years 2 months ago
A New Dynamic Wavelength Assignment Scheme in Wavelength-Convertible WBS Networks
—In the paper, we study the wavelength assignment problem in waveband switching (WBS) networks, which is composed of multi-granular optical cross-connect (MG-OXCs) interconnected...
Ching-Fang Hsu, Fang-Sheng Lin, Ke-Kuan Hsu
ICWN
2003
13 years 9 months ago
Comparison of Heuristic and Optimal Subcarrier Assignment Algorithms
Wireless multi carrier approaches can support the simultaneous transmissions to several wireless terminals, each one getting only some of the available subcarriers. Judiciously ass...
James Gross, Holger Karl, Frank H. P. Fitzek, Adam...