Sciweavers

2200 search results - page 256 / 440
» The Generalized Pignistic Transformation
Sort
View
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
15 years 5 months ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
AAAI
1990
15 years 5 months ago
Very Fast Decision Table Execution of Propositional Expert Systems
A formal equivalence between propositional expert systems and decision tables is proved, and a practicable procedure given to perform the transformation between propositional expe...
Robert M. Colomb, Charles Y. C. Chung
SLP
1989
87views more  SLP 1989»
15 years 5 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
WCE
2007
15 years 5 months ago
MR Image Reconstruction from Pseudo-Hex Lattice Sampling Patterns Using Separable FFT
Abstract— Common MRI sampling patterns in kspace, such as spiral trajectories, have nonuniform density and do not lie on a rectangular grid. We propose mapping the sampled data t...
Jae-Ho Kim, Fred L. Fontaine
ECAI
2010
Springer
15 years 5 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave