Sciweavers

1484 search results - page 181 / 297
» Ants meeting algorithms
Sort
View
PARELEC
2002
IEEE
15 years 11 months ago
Real-Time Scheduling in Distributed Systems
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
Nguyen Duc Thai
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 10 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
15 years 10 months ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
15 years 10 months ago
Evolutionary design of single-mode microstructured polymer optical fibres using an artificial embryogeny representation
Polymer microstructured optical fibres are a relatively recent development in optical fibre technology, supporting a wide variety of microstructure fibre geometries, when compared...
Steven Manos, Maryanne Large, Leon Poladian
EURODAC
1995
IEEE
202views VHDL» more  EURODAC 1995»
15 years 9 months ago
Hardware-software co-synthesis of fault-tolerant real-time distributed embedded systems
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
Santhanam Srinivasan, Niraj K. Jha