Sciweavers

3678 search results - page 146 / 736
» On the Stable Paths Problem
Sort
View
AIPS
2008
15 years 3 months ago
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous...
Miguel A. González, Camino R. Vela, Ramiro ...
ALIFE
2000
15 years 1 months ago
Open Problems in Artificial Life
This article lists fourteen open problems in artificial life, each of which is a grand challenge requiring a major advance on a fundamental issue for its solution. Each problem is ...
Mark A. Bedau, John S. McCaskill, Norman H. Packar...
CORR
1999
Springer
145views Education» more  CORR 1999»
15 years 25 days ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
MST
2011
200views Hardware» more  MST 2011»
14 years 8 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
ICC
2009
IEEE
129views Communications» more  ICC 2009»
15 years 8 months ago
Do Next Generation Networks Need Path Diversity?
—We have currently reached a phase where big shifts in the network traffic might impose to rethink the design of current architectures, and where new technologies, being pushed ...
Luca Muscariello, Diego Perino, Dario Rossi