3907 search results - page 68 / 782 » Time, Knowledge, and Choice |
122
click to vote
ICANN
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Some issues about the generalization of ANN training are investigated through experiments with several synthetic time series and real world time series. One commonly acce...
132
click to vote
FM
2001
Springer
15 years 8 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
157
click to vote
IEEEPACT
1997
IEEE
15 years 8 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
122
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
141
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorit...