2988 search results - page 48 / 598 » Experiments with a New Boosting Algorithm |
FLAIRS
2004
14 years 11 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
109
click to vote
SAC
2011
ACM
14 years 16 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
110
click to vote
AIPS
2008
15 years 1 days ago
2008
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
ISDA
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we address some open questions on the recently proposed Zero-Error Density Maximization algorithm for MLP training. We propose a new version of the cost function tha...
ACIVS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This article deals with a monocular vision system for grasping gesture acquisition. This system could be used for medical diagnostic, robot or game control. We describe a...