914 search results - page 36 / 183 » Branch and Bound on the Network Model |
69
Voted
IJFCS
2006
14 years 9 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
101
click to vote
NECO
2010
14 years 8 months ago
2010
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
ANOR
2010
14 years 9 months ago
2010
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
CP
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...