Sciweavers

4560 search results - page 131 / 912
» Finding Data in the Neighborhood
Sort
View
ICANN
2007
Springer
14 years 2 months ago
Neural Mechanisms for Mid-Level Optical Flow Pattern Detection
This paper describes a new model for extracting large-field optical flow patterns to generate distributed representations of neural activation to control complex visual tasks such ...
Stefan Ringbauer, Pierre Bayerl, Heiko Neumann
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
14 years 2 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Average Parameters of Graphs
Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we consider the average ...
Oded Goldreich, Dana Ron
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 11 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
COR
2010
127views more  COR 2010»
13 years 8 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...