3247 search results - page 310 / 650 » Randomized smoothing networks |
167
click to vote
UAI
2003
15 years 7 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
146
click to vote
ESM
2000
15 years 7 months ago
2000
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...
148
click to vote
COR
2008
15 years 6 months ago
2008
In this paper a two-level hierarchical model for the location of concentrators and routers in computers networks is presented. Given a set of candidate locations and the capacitie...
159
click to vote
ICONIP
2010
15 years 4 months ago
2010
Abstract. Reservoir computing approaches have been successfully applied to a variety of tasks. An inherent problem of these approaches, is, however, their variation in performance ...
186
Voted
INFORMS
2010
15 years 4 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...