Sciweavers

6045 search results - page 312 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
TR
2008
117views more  TR 2008»
15 years 7 months ago
Redundancy Allocation for Series-Parallel Systems Using Integer Linear Programming
We consider the problem of maximizing the reliability of a series-parallel system given cost and weight constraints on the system. The number of components in each subsystem and th...
Alain Billionnet
CN
2008
118views more  CN 2008»
15 years 7 months ago
Modeling and computing throughput capacity of wireless multihop networks
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
Patrick Stuedi, Gustavo Alonso
ENTCS
2008
99views more  ENTCS 2008»
15 years 7 months ago
Specifying Properties of Concurrent Computations in CLF
CLF (the Concurrent Logical Framework) is a language for specifying and reasoning about concurrent systems. Its most significant feature is the first-class representation of concu...
Kevin Watkins, Iliano Cervesato, Frank Pfenning, D...
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
15 years 10 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
HYBRID
2010
Springer
15 years 9 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...