Results 1  10
of
1,854,704
The Nature of Statistical Learning Theory
, 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract

Cited by 12976 (32 self)
 Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based
A New Heuristic Algorithm For The Linear Arrangement Problem
, 1999
"... . A new algorithm for the linear arrangement problem is described. The goal is to produce linear arrangements of software model diagrams such that the total length of all connections is reduced as much as possible. The algorithm uses the same general numbering strategy as existing algorithms for the ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
with an eigenvaluebased linear arrangement algorithm. The new heuristic is also shown to require slightly less execution time than the frontal increase minimization heuristic used by several bandwidth and profile reduction algorithms, and far less execution time than the eigenvaluebased algorithm. Key words. graph
3 NEW HEURISTIC ALGORITHMS FOR THE CREW SCHEDULING PROBLEM
"... Abstract: In this paper we describe the implementation of two Tabu search based algorithms for the Crew Scheduling Problem (CSP). The problem is a standard CSP, for an urban transport problem, formulated as the minimal number of duties necessary to cover a predefined timetable under contractual rule ..."
Abstract
 Add to MetaCart
. In this paper we describe two heuristic algorithms for the Crew Scheduling Problem (CSP). The problem is formulated as the minimum number of duties
New heuristic algorithms for the windy rural postman problem
"... In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting reallife applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Pro ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting reallife applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman
A New Heuristic Algorithm for the Classical Symmetric Traveling Salesman Problem
"... Abstract—This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by mov ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution
A New Heuristic Algorithm Solving The Linear Ordering Problem
, 1994
"... The linear ordering problem is an NP hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. Thi ..."
Abstract

Cited by 34 (0 self)
 Add to MetaCart
. This is particularly true for the question of developing good heuristic algorithms solving this problem.
COLLHAPS: A NEW HEURISTIC ALGORITHM FOR HAPLOTYPE INFERENCE BY MAXIMUM PARSIMONY
"... The authors wish to thank Giuseppe Lancia for many valuable discussions on the topic and the authors of the programs used in the experiments for providing their software. ISSN: 1128–3378 ..."
Abstract
 Add to MetaCart
The authors wish to thank Giuseppe Lancia for many valuable discussions on the topic and the authors of the programs used in the experiments for providing their software. ISSN: 1128–3378
The FF planning system: Fast plan generation through heuristic search
 Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract

Cited by 822 (53 self)
 Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts
Heuristic Evaluation of User Interfaces
 IN: PROCEEDINGS OF THE CHI´90 CONFERENCE, SEATTLE
, 1990
"... Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four experiments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found betw ..."
Abstract

Cited by 502 (4 self)
 Add to MetaCart
Heuristic evaluation is an informal method of usability analysis where a number of evaluators are presented with an interface design and asked to comment on it. Four experiments showed that individual evaluators were mostly quite bad at doing such heuristic evaluations and that they only found
Results 1  10
of
1,854,704