Sciweavers

6833 search results - page 383 / 1367
» Some two-character sets
Sort
View
APAL
2006
64views more  APAL 2006»
15 years 7 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
APAL
2006
60views more  APAL 2006»
15 years 7 months ago
The Proper Forcing Axiom, Prikry forcing, and the Singular Cardinals Hypothesis
The purpose of this paper is to present some results which suggest that the Singular Cardinals Hypothesis follows from the Proper Forcing Axiom. What will be proved is that a form ...
Justin Tatch Moore
EOR
2008
90views more  EOR 2008»
15 years 7 months ago
An improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
AUTOMATICA
2006
81views more  AUTOMATICA 2006»
15 years 7 months ago
A new concept of invariance for saturated systems
: In this paper, a new concept of invariance for saturated linear systems is presented. This new notion of invariance, denoted SNS-invariance, has a number of geometrical propertie...
T. Alamo, A. Cepeda, Daniel Limón, Eduardo ...
AUTOMATICA
2006
106views more  AUTOMATICA 2006»
15 years 7 months ago
Barrier certificates for nonlinear model validation
Abstract-- New methods for model validation of continuoustime nonlinear systems with uncertain parameters are presented in this paper. The methods employ functions of state-paramet...
Stephen Prajna