Sciweavers

6142 search results - page 85 / 1229
» The Complexity of Partition Functions
Sort
View
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 1 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima

Publication
331views
16 years 9 months ago
On Accurate and Efficient Statistical Counting in Sensor-Based Surveillance Systems
Sensor networks have been used in many surveillance systems, providing statistical information about monitored areas. Accurate counting information (e.g., the distribution of the ...
Shuo Guo, Tian He, Mohamed F. Mokbel, John A. Stan...
NIPS
2008
14 years 11 months ago
Measures of Clustering Quality: A Working Set of Axioms for Clustering
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
Shai Ben-David, Margareta Ackerman
SPLC
2008
14 years 11 months ago
Modeling the Variability Space of Self-Adaptive Applications
Modeling self-adaptive applications is a difficult task due to the complex relationships they have with their environments. Designers of such applications strive to model accurate...
Gilles Perrouin, Franck Chauvel, Julien DeAntoni, ...
AGENTS
1999
Springer
15 years 2 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso