Sciweavers

3652 search results - page 98 / 731
» A study of query length
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 8 months ago
The Complexity of Finding Reset Words in Finite Automata
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word ha...
Jörg Olschewski, Michael Ummels
IJCGA
2006
91views more  IJCGA 2006»
13 years 8 months ago
The Tsp and the Sum of its Marginal Values
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
Moshe Dror, Yusin Lee, James B. Orlin, Valentin Po...
QUESTA
2006
87views more  QUESTA 2006»
13 years 7 months ago
Some universal limits for nonhomogeneous birth and death processes
In this paper we consider nonhomogeneous birth and death processes (BDP) with periodic rates. Two important parameters are studied, which are helpful to describe a nonhomogeneous B...
Alexander I. Zeifman, S. Leorato, E. Orsingher, Ya...
QUESTA
2007
91views more  QUESTA 2007»
13 years 7 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands
PE
2010
Springer
116views Optimization» more  PE 2010»
13 years 6 months ago
A polling model with multiple priority levels
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which custom...
Marko A. A. Boon, Ivo J. B. F. Adan, Onno J. Boxma