Sciweavers

3311 search results - page 584 / 663
» Deductive Object Programming
Sort
View
GECCO
2000
Springer
168views Optimization» more  GECCO 2000»
15 years 1 months ago
A Fault-tolerant Multicast Routing Algorithm in ATM Networks
This paper presents a genetic algorithm based method to solve the capacity and routing assignment problem arising in the design of selfhealing networks using the Virtual Path (VP)...
Sam Kwong, S. S. Chan
HUC
2000
Springer
15 years 1 months ago
Real-World Graphical User Interfaces
Although the age of information appliances is getting close, current remote control devices are too awkward, and we cannot control sophisticated equipments without using graphical ...
Toshiyuki Masui, Itiro Siio
INFOCOM
2000
IEEE
15 years 1 months ago
Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
Tibor Cinkler, Dániel Marx, Claus Popp Lars...
ICCAD
1995
IEEE
129views Hardware» more  ICCAD 1995»
15 years 1 months ago
Activity-driven clock design for low power circuits
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...
Gustavo E. Téllez, Amir H. Farrahi, Majid S...
LICS
1997
IEEE
15 years 1 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...