Sciweavers

2467 search results - page 314 / 494
» Finite State Machines
Sort
View
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
15 years 6 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...
JUCS
2002
73views more  JUCS 2002»
15 years 6 months ago
Some Remarks on Codes Defined by Petri Nets
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
Masami Ito, Jürgen Dassow, Ralf Stiebe
CG
2010
Springer
15 years 4 months ago
A Principled Method for Exploiting Opening Books
We used in the past a lot of computational power and human expertise for having a very big dataset of good 9x9 Go games, in order to build an opening book. We improved a lot the al...
Romaric Gaudel, Jean-Baptiste Hoock, Julien Perez,...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 4 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
ECAI
2008
Springer
15 years 8 months ago
A probabilistic analysis of diagnosability in discrete event systems
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
Farid Nouioua, Philippe Dague