14382 search results - page 311 / 2877 » Time in Connectionist Models |
219
click to vote
PDP
2002
IEEE
15 years 11 months ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
160
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
190
click to vote
ZUM
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a new combination CSP-OZ-DC of three well researched formal techniques for the specification of processes, data and time: CSP [17], Object-Z [36], and Duration...
169
click to vote
ESORICS
2006
Springer
15 years 10 months ago
2006
Springer
Timing side channels are a serious threat to the security of cryptographic algorithms. This paper presents a novel method for the timing-sensitive analysis of information flow in s...
139
click to vote
NIPS
2004
15 years 8 months ago
2004
Bayesian Regularization and Nonnegative Deconvolution (BRAND) is proposed for estimating time delays of acoustic signals in reverberant environments. Sparsity of the nonnegative f...