Sciweavers

1101 search results - page 23 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
CEC
2007
IEEE
15 years 4 months ago
Convergence and rate of convergence of a foraging ant model
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
Amine M. Boumaza, Bruno Scherrer
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 3 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee
HEURISTICS
2010
14 years 4 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
82
Voted
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 2 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
CORR
2011
Springer
159views Education» more  CORR 2011»
14 years 4 months ago
Multicriteria Steiner Tree Problem for Communication Network
Abstract—This paper addresses combinatorial optimization schemes for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh...
Mark Sh. Levin, Rustem I. Nuriakhmetov