Zobrazeno 1 - 10
of 200
pro vyhledávání: '"Roger L. Wainwright"'
Publikováno v:
IEEE Instrumentation & Measurement Magazine. 10:26-31
Engineers and scientists use instrumentation and measurement equipment to obtain information for specific environments, such as temperature and pressure. This task can be performed manually using portable gauges. However, there are many instances in
Publikováno v:
Annals of Operations Research. 86:161-177
We review and analyze a formal problem of fault location in point‐to‐point telecommunicationnetworks which are modeled as undirected graphs. For a network with no bridgeedges, we present a technique for constructing a tour that is able to locate
Publikováno v:
INFORMS Journal on Computing. 9:266-275
Cartographic label placement is one of the most time-consuming tasks in the production of high quality maps and other high quality graphical displays. It is essential that text labels used to identify various features and objects be placed in a clear
Publikováno v:
SIGCSE
In this paper we discuss the design and implementation of GATutor, a graphical tutorial system for genetic algorithms (GA). The X Window/Motif system provides powerful tools for the development of a user interfaces with a familiar feel and look. We i
Autor:
Roger L. Wainwright
Publikováno v:
ACM SIGICE Bulletin. 19:30-36
LibGA, HYPERGEN and GATutor represent a trio of in-house developed genetic algorithm software packages for conducting research in combinatorial optimization problems. For a variety of reasons, these packages were developed using the C programming lan
Autor:
Roger L. Wainwright, Faris N. Abuali
Publikováno v:
Software: Practice and Experience. 23:1267-1283
In recent years several authors have investigated binary search trees with minimal internal path length. In this paper we propose relaxing the requirement of inserting all nodes on one level before going to the next level. This leads to a new class o
Autor:
Y. Alkhalifah, Roger L. Wainwright
Publikováno v:
IEEE Congress on Evolutionary Computation
Many graph problems seek subsets of their vertices that maximize or minimize objective functions on the vertices. Among these are the capacitated p-median problem, the geometric connected dominating set problem, the capacitated k-center problem, and
Autor:
Roger L. Wainwright, Track Chair
Publikováno v:
Proceedings of the 2003 ACM symposium on Applied computing.
Autor:
Roger L. Wainwright
Publikováno v:
Proceedings of the 2003 ACM symposium on Applied computing.