1160 search results - page 152 / 232 » Dynamic Programming Algorithm for Training Functional Networ... |
166
Voted
ICNP
2002
IEEE
15 years 7 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
134
Voted
IFL
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...
111
Voted
INFORMATICALT
2007
15 years 2 months ago
2007
In this paper we propose a modified framework of support vector machines, called Oblique Support Vector Machines(OSVMs), to improve the capability of classification. The principl...
165
click to vote
NABIC
2010
14 years 9 months ago
2010
A new design method for Cellular automata (CA) rules are described. We have already proposed a method for designing the transition rules of two-dimensional 256-state CA for graysca...
126
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...