895 search results - page 128 / 179 » Using graphs for some discrete tomography problems |
127
Voted
HYBRID
2010
Springer
15 years 10 months ago
2010
Springer
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
144
Voted
IWDC
2005
Springer
15 years 9 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
129
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
106
Voted
JSSPP
1997
Springer
15 years 7 months ago
1997
Springer
It is generally agreed that memory requirements should be taken into account in the scheduling of parallel jobs. However, so far the work on combined processor and memory schedulin...
115
Voted
AEI
2005
15 years 3 months ago
2005
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...