1095 search results - page 150 / 219 » Preprocessing of Intractable Problems |
92
Voted
EPIA
2001
Springer
15 years 5 months ago
2001
Springer
Dealing with temporality on actions presents an important challenge to AI planning. Unlike Graphplan-based planners which alternate levels of propositions and actions in a regular ...
102
Voted
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
Authorship verification is the task of determining whether documents were or were not written by a certain author. The problem has been faced by using binary classifiers, one per a...
99
Voted
CCCG
2008
15 years 2 months ago
2008
Many important problems in Computational Geometry needs to perform some kind of angle processing. The Polar Diagram [4] is a locus approach for problems processing angles. Using t...
106
click to vote
CORR
2002
Springer
15 years 12 days ago
2002
Springer
We have analyzed manufacturing data from several different semiconductor manufacturing plants, using decision tree induction software called Q-YIELD. The software generates rules ...
99
Voted
JMLR
2010
14 years 7 months ago
2010
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...