Sciweavers

744 search results - page 78 / 149
» Observations on the Decidability of Transitions
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 9 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
JSW
2006
56views more  JSW 2006»
13 years 9 months ago
Evolutionary Computing for Detection of Retentive Structures in Coastal Waters
The demography of anchovy fishes in the Gulf of Biscay seems to be related to the presence of socalled "retentive" hydrodynamical structures, that keep fish eggs and larv...
Marc Segond, Denis Robilliard, Virginie Marion-Pot...
KBS
2007
86views more  KBS 2007»
13 years 9 months ago
On-line monitoring of plan execution: A distributed approach
The paper introduces and formalizes a distributed approach for the model-based monitoring of the execution of a plan, where concurrent actions are carried on by a team of mobile r...
Roberto Micalizio, Pietro Torasso
JMLR
2010
128views more  JMLR 2010»
13 years 7 months ago
On the Rate of Convergence of the Bagged Nearest Neighbor Estimate
Bagging is a simple way to combine estimates in order to improve their performance. This method, suggested by Breiman in 1996, proceeds by resampling from the original data set, c...
Gérard Biau, Frédéric C&eacut...
SIAMJO
2010
135views more  SIAMJO 2010»
13 years 7 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs