Sciweavers

10412 search results - page 1433 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 7 months ago
De Bruijn Graph Homomorphisms and Recursive De Bruijn Sequences
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
Abbas Alhakim, Mufutau Akinwande
DEBU
2010
108views more  DEBU 2010»
15 years 7 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
DEDS
2010
88views more  DEDS 2010»
15 years 7 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
CSJM
2008
38views more  CSJM 2008»
15 years 7 months ago
Evaluation of the traffic coefficient in priority queueing systems
Methodology and algorithms of evaluation of the traffic coefficient in priority queueing systems with zero and nonzero switchover times are presented. In the case of zero switchov...
Gh. Mishkoy, A. Iu. Bejan, O. Benderschi
AMAI
2006
Springer
15 years 7 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
« Prev « First page 1433 / 2083 Last » Next »