2485 search results - page 28 / 497 » Time Bounded Frequency Computations |
WG
1998
Springer
13 years 12 months ago
1998
Springer
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
JSSPP
2007
Springer
14 years 1 months ago
2007
Springer
Most space-sharing parallel computers presently operated by high-performance computing centers use batch-queuing systems to manage processor allocation. Because these machines are...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
We study time delay estimation (TDE) on parallel channels with flat fading. Several models for the channel gains are considered, and for each case we present the the maximum like...
EOR
2007
13 years 7 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...