Sciweavers

13376 search results - page 279 / 2676
» Problem Solving with
Sort
View
GG
2008
Springer
15 years 4 months ago
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
We consider four different models of process interactions that unify and generalise models introduced and studied by Angluin et al. [AAD+ 04] and models introduced and studied by ...
Jérémie Chalopin, Antoni W. Mazurkie...
ICDAR
2009
IEEE
15 years 1 months ago
Learning on the Fly: Font-Free Approaches to Difficult OCR Problems
Despite ubiquitous claims that optical character recognition (OCR) is a "solved problem," many categories of documents continue to break modern OCR software such as docu...
Andrew Kae, Erik G. Learned-Miller
ICPR
2008
IEEE
16 years 5 months ago
Efficient implementation of SVM for large class problems
Multiclass classification is an important problem in pattern recognition. Hierarchical SVM classifiers such as DAG-SVM and BHC-SVM are popular in solving multiclass problems. Howe...
Prabakaran Ilayaraja, N. V. Neeba, C. V. Jawahar
AIR
2010
96views more  AIR 2010»
15 years 4 months ago
Logic programming for combinatorial problems
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
Toshinori Munakata, Roman Barták
EVOW
2007
Springer
15 years 10 months ago
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges
Abstract. The Traveling Salesman Problem (TSP) is a well-known NPhard combinatorial optimization problem, for which a large variety of evolutionary algorithms are known. However, t...
Thomas Fischer, Peter Merz