Sciweavers

6020 search results - page 846 / 1204
» A New Approach to Model Counting
Sort
View
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
16 years 1 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
CSCWD
2009
Springer
16 years 1 months ago
Using Petri Nets to specify collaborative three dimensional interaction
This work presents a methodology to formally model and to build collaborative three dimensional interaction tasks in virtual environments using three different tools: Petri Nets, ...
Rafael Rieder, Marcio Sarroglia Pinho, Alberto Bar...
IDA
2009
Springer
16 years 1 months ago
Improving Time Series Forecasting by Discovering Frequent Episodes in Sequences
Abstract. This work aims to improve an existing time series forecasting algorithm –LBF– by the application of frequent episodes techniques as a complementary step to the model....
Francisco Martínez-Álvarez, Alicia T...
IDEAL
2009
Springer
16 years 1 months ago
Clustering with XCS and Agglomerative Rule Merging
Abstract. In this paper, we present a more effective approach to clustering with eXtended Classifier System (XCS) which is divided into two phases. The first phase is the XCS le...
Liangdong Shi, Yinghuan Shi, Yang Gao
CANDC
2009
ACM
16 years 1 months ago
Growing and destroying the worth of ideas
This paper presents a novel computational approach to the study of creativity. In particular, it discusses a modeling framework that addresses the worth of ideas ascribed by agent...
Ricardo Sosa, John S. Gero, Kyle Jennings