9842 search results - page 222 / 1969 » Problem complexity |
111
Voted
PRICAI
2000
Springer
15 years 6 months ago
2000
Springer
The automated prediction of a user's interests and requirements is an area of interest to the Artificial Intelligence community. However, current predictive statistical approa...
105
Voted
AUSAI
2008
Springer
15 years 4 months ago
2008
Springer
Learning Classifier System (LCS) is an effective tool to solve classification problems. Clustering with XCS (accuracy-based LCS) is a novel approach proposed recently. In this pape...
114
Voted
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
15 years 4 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
156
click to vote
FOSSACS
2008
Springer
15 years 4 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
129
Voted
WSCG
2004
15 years 4 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...