The following pages link to Sicco Verwer (Q420916):
Displaying 20 items.
- Efficiently identifying deterministic real-time automata from labeled data (Q420918) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- (Q479464) (redirect page) (← links)
- \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition (Q479466) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Auction optimization using regression trees and linear models as integer programs (Q511796) (← links)
- (Q553333) (redirect page) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- Learning decision trees with flexible constraints and objectives using integer optimization (Q2011578) (← links)
- Black-box combinatorial optimization using models with integer-valued minima (Q2043440) (← links)
- Data driven design for online industrial auctions (Q2043444) (← links)
- Regular Inference as Vertex Coloring (Q3164812) (← links)
- Polynomial Distinguishability of Timed Automata (Q3528423) (← links)
- Exact DFA Identification Using SAT Solvers (Q3588365) (← links)
- A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data (Q3588378) (← links)
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (Q3618628) (← links)
- Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with<i>IDP3</i> (Q4593015) (← links)
- (Q5398039) (← links)
- PDFA distillation with error bound guarantees (Q6666785) (← links)
- On bidirectional deterministic finite automata (Q6666791) (← links)
