Sciweavers

33 search results - page 5 / 7
» On Minimal Words With Given Subword Complexity
Sort
View
EOR
2007
102views more  EOR 2007»
13 years 8 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux
STACS
2004
Springer
14 years 1 months ago
On Minimum Circular Arrangement
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
Murali K. Ganapathy, Sachin Lodha
MA
2010
Springer
132views Communications» more  MA 2010»
13 years 7 months ago
Model selection by sequentially normalized least squares
Model selection by the predictive least squares (PLS) principle has been thoroughly studied in the context of regression model selection and autoregressive (AR) model order estima...
Jorma Rissanen, Teemu Roos, Petri Myllymäki
TALG
2008
97views more  TALG 2008»
13 years 8 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang