Integrating Instance-level and Attribute-level Knowledge into Document Clustering
Jinlong Wang, Shunyao Wu, Gang Li, Zhe Wei (2011)
Computer Science and Information Systems
Similarity:
Displaying similar documents to “Distributed Parameter Tuning for Genetic Algorithms”
Integrating Instance-level and Attribute-level Knowledge into Document Clustering
A Case Study on Availability of Sensor Data in Agent Cooperation
Christian Johansson, Fredrik Wernstedt, Paul Davidsson (2010)
Computer Science and Information Systems
Similarity:
Extracting Minimal Unsatisfiable Subformulas in Satisfiability Modulo Theories
Jianmin Zhang, Shengyu Shen, Jun Zhang, Weixia Xu, Sikun Li (2011)
Computer Science and Information Systems
Similarity:
Detecting Concurrency Anomalies in Transactional Memory Programs
João Lourenço, Diogo Sousa, Bruno Teixeira, Ricardo Dias (2011)
Computer Science and Information Systems
Similarity:
Access Control Framework for XML Document Collections
Goran Sladić, Branko Milosavljević, Zora Konjović, Milan Vidaković (2011)
Computer Science and Information Systems
Similarity:
TEAMLOG in Action: a Case Study in Teamwork
Barbara Dunin-Kęplicz, Rineke Verbrugge, Micha l Ślizak (2010)
Computer Science and Information Systems
Similarity:
Imprecise notions in individual and group decision theory: Resolutions of Allais paradox and related problems.
Hannu Nurmi (1982)
Stochastica
Similarity:
This paper deals with two ways in which uncertainty notions enter social science models: 1) They can be used in an effort to make intelligible some phenomena that would otherwise be difficult to comprehend, or 2) They can be use to generalize or modify the domain of validity of some theoretical results.
Impartial truth.
David Miller (1982)
Stochastica
Similarity:
Some remarks on a problem of C. Alsina.
J. Matkowski, M. Sablik (1986)
Stochastica
Similarity:
Equation [1] f(x+y) + f (f(x)+f(y)) = f (f(x+f(y)) + f(f(x)+y)) has been proposed by C. Alsina in the class of continuous and decreasing involutions of (0,+∞). General solution of [1] is not known yet. Nevertheless we give solutions of the following equations which may be derived from [1]: [2] f(x+1) + f (f(x)+1) = 1, [3] f(2x) + f(2f(x)) = f(2f(x + f(x))). Equation [3] leads to a Cauchy functional equation: ...
Representation of continuous associative functions.
Barbara Baccheli (1986)
Stochastica
Similarity:
Strengthened forms of Ling's representation theorem concerning a class of continuous associative functions are given: Firstly the monotonicity condition is removed. Then the associativity condition is replaced by the power associativity.