Sciweavers

2474 search results - page 63 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
IWCMC
2006
ACM
15 years 8 months ago
Effective channel assignment in multi-hop W-CDMA cellular networks
Multi-hop relaying is an important concept in tackling the inherent problems of limited capacity and coverage in cellular networks. It helps to solve the dead-spots problem and to...
Yik Hung Tam, Hossam S. Hassanein, Selim G. Akl
ANOR
2005
72views more  ANOR 2005»
15 years 2 months ago
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
Gary A. Kochenberger, Fred Glover, Bahram Alidaee,...
131
Voted
PVM
2010
Springer
15 years 25 days ago
Massively Parallel Finite Element Programming
Abstract. Today’s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data struc...
Timo Heister, Martin Kronbichler, Wolfgang Bangert...
NCA
2008
IEEE
15 years 2 months ago
Neurodynamic programming: a case study of the traveling salesman problem
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
Jia Ma, Tao Yang, Zeng-Guang Hou, Min Tan, Derong ...
AIEDAM
2008
102views more  AIEDAM 2008»
15 years 2 months ago
Machine invention of quantum computing circuits by means of genetic programming
We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...
Lee Spector, Jon Klein