Sciweavers

17129 search results - page 3384 / 3426
» Applied Computing
Sort
View
CONSTRAINTS
2007
112views more  CONSTRAINTS 2007»
14 years 9 months ago
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
Francisco Azevedo
89
Voted
COR
2007
163views more  COR 2007»
14 years 9 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
CSDA
2007
105views more  CSDA 2007»
14 years 9 months ago
Model selection for support vector machines via uniform design
The problem of choosing a good parameter setting for a better generalization performance in a learning task is the so-called model selection. A nested uniform design (UD) methodol...
Chien-Ming Huang, Yuh-Jye Lee, Dennis K. J. Lin, S...
JUCS
2008
130views more  JUCS 2008»
14 years 9 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
JCT
2006
100views more  JCT 2006»
14 years 9 months ago
Enumeration of unrooted maps of a given genus
Let Ng(f ) denote the number of rooted maps of genus g having f edges. An exact formula for Ng(f ) is known for g = 0 (Tutte, 1963), g = 1 (Arques, 1987), g = 2,3 (Bender and Canf...
Alexander Mednykh, Roman Nedela
« Prev « First page 3384 / 3426 Last » Next »