Sciweavers

885 search results - page 147 / 177
» Optimal Polygon Placement
Sort
View
GLOBECOM
2008
IEEE
13 years 7 months ago
Network Planning for Next-Generation Metropolitan-Area Broadband Access under EPON-WiMAX Integration
Abstract--This paper tackles a fundamental problem of network planning and dimensioning under EPON-WiMAX integration for next-generation wireless metropolitan-area broadband access...
Bin Lin, Pin-Han Ho, Xuemin Shen, Frank Chih-Wei S...
CCE
2006
13 years 7 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
FGCS
2006
119views more  FGCS 2006»
13 years 7 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
Markus Nordén, Sverker Holmgren, Michael Th...
GLOBECOM
2010
IEEE
13 years 5 months ago
The Information Propagation Speed Upper Bound in Cognitive Radio Networks
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
Chuan Han, Yaling Yang
GECCO
2011
Springer
256views Optimization» more  GECCO 2011»
12 years 11 months ago
Evolving complete robots with CPPN-NEAT: the utility of recurrent connections
This paper extends prior work using Compositional Pattern Producing Networks (CPPNs) as a generative encoding for the purpose of simultaneously evolving robot morphology and contr...
Joshua E. Auerbach, Josh C. Bongard