1579 search results - page 140 / 316 » How Good is the Crowd at |
CP
2006
Springer
14 years 1 days ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
FSTTCS
2006
Springer
13 years 12 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
In this paper, we describe our experience with developing Airshed, a large pollution modeling application, in the Fx programming environment. We demonstrate that high level parall...
COLT
1995
Springer
13 years 12 months ago
1995
Springer
We propose and analyze a distribution learning algorithm for a subclass of Acyclic Probabilistic Finite Automata (APFA). This subclass is characterized by a certain distinguishabi...
ASM
2010
ASM
13 years 11 months ago
2010
ASM
The B method is one of the most used formal methods, when reactive systems is under question, due to good support for refinement. However, obtaining the formal model from requireme...