Sciweavers

2536 search results - page 151 / 508
» Constructing Optimal Highways
Sort
View
GPCE
2008
Springer
15 years 29 days ago
Generating incremental implementations of object-set queries
High-level query constructs help greatly improve the clarity of programs and the productivity of programmers, and are being introduced to increasingly more languages. However, the...
Tom Rothamel, Yanhong A. Liu
PE
1998
Springer
158views Optimization» more  PE 1998»
14 years 11 months ago
Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations
Asymptotic approximations are constructed for the performance measures of product form queueing networks consisting of single server, fixed rate nodes with large populations. The...
Charles Knessl, Charles Tier
INFOCOM
2005
IEEE
15 years 5 months ago
Optical switching networks with minimum number of limited range wavelength converters
— We study the problem of determining the minimum number of limited range wavelength converters needed to construct strictly, wide-sense, and rearrangeably nonblocking optical cr...
Hung Q. Ngo, Dazhen Pan, Yuanyuan Yang
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
15 years 5 months ago
Grammatical Swarm
Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
Michael O'Neill, Anthony Brabazon
ICCAD
1994
IEEE
101views Hardware» more  ICCAD 1994»
15 years 4 months ago
A general framework for vertex orderings, with applications to netlist clustering
We present a general framework for the construction of vertex orderings for netlist clustering. Our WINDOW algorithm constructs an ordering by iteratively adding the vertex with h...
Charles J. Alpert, Andrew B. Kahng