Sciweavers

15351 search results - page 2900 / 3071
» The information bottleneck method
Sort
View
CN
1999
100views more  CN 1999»
13 years 10 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
JAR
1998
134views more  JAR 1998»
13 years 10 months ago
Integrating Computer Algebra into Proof Planning
Mechanized reasoning systems and computer algebra systems have different objectives. Their integration is highly desirable, since formal proofs often involve both of the two differ...
Manfred Kerber, Michael Kohlhase, Volker Sorge
DAM
1999
100views more  DAM 1999»
13 years 10 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
KI
2002
Springer
13 years 10 months ago
Spatial Strategies in Human-Robot Communication
This paper deals with various kinds of mental representations available for linguistic instruction in spatial humanrobot interaction. After a survey of the literature on spatial r...
Thora Tenbrink, Kerstin Fischer, Reinhard Moratz
NN
1998
Springer
177views Neural Networks» more  NN 1998»
13 years 10 months ago
Soft vector quantization and the EM algorithm
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
Ethem Alpaydin
« Prev « First page 2900 / 3071 Last » Next »