Sciweavers

5055 search results - page 458 / 1011
» Relative Timing
Sort
View
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
16 years 1 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
FPL
2004
Springer
75views Hardware» more  FPL 2004»
16 years 1 months ago
Multiple Restricted Multiplication
Abstract. This paper focuses on a class of problem relating to the multiplication of a single number by several coefficients that, while not constant, are drawn from a finite set ...
Nalin Sidahao, George A. Constantinides, Peter Y. ...
GECCO
2004
Springer
166views Optimization» more  GECCO 2004»
16 years 1 months ago
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
Joc Cing Tay, Djoko Wibowo
ICCS
2004
Springer
16 years 1 months ago
Evolutionary State Assignment for Synchronous Finite State Machines
: Synchronous finite state machines are very important for digital sequential designs. Among other important aspects, they represent a powerful way for synchronizing hardware comp...
Nadia Nedjah, Luiza de Macedo Mourelle
ICOIN
2004
Springer
16 years 1 months ago
A Study of Internet Packet Reordering
Packet reordering is a well-known phenomenon that the order of packets is inverted in the Internet. Previous research indicates reordering can affect the performance of both the ne...
Yi Wang, Guohan Lu, Xing Li