2635 search results - page 64 / 527 » Computing multihomogeneous resultants using straight-line pr... |
168
Voted
NCA
2008
IEEE
15 years 2 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
201
click to vote
GPEM
2011
14 years 10 months ago
2011
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropr...
145
click to vote
CP
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
115
click to vote
PPOPP
1995
ACM
15 years 6 months ago
1995
ACM
It is widely acknowledged in high-performance computing circles that parallel input/output needs substantial improvement in order to make scalable computers truly usable. We prese...
124
Voted
EOR
2006
15 years 2 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...