Sciweavers

4498 search results - page 238 / 900
» How to Invent Functions
Sort
View
CEC
2007
IEEE
15 years 11 months ago
Greedy transformation of evolutionary algorithm search spaces for scheduling problems
— Many scheduling algorithms search the space of possible solutions (schedules), but some instead search the space of permutations of the set of jobs, employing a greedy algorith...
David Joslin, Justin Collins
ICC
2007
IEEE
117views Communications» more  ICC 2007»
15 years 11 months ago
On the Fade Duration Distribution in Nakagami Fading Channels
− During almost fifty years the Fade Duration Distribution (FDD) of random signals has been an open research topic. However, for Nakagami fading channels, and in general for the ...
A. F. Ramos-Alarcón, Valeri Ya. Kontorovitc...
ICCCN
2007
IEEE
15 years 11 months ago
Design of a Network Service Architecture
— Considerable research efforts in the networking community are focused on defining a new Internet architecture that not only solves some of the problems of the current design, ...
Sivakumar Ganapathy, Tilman Wolf
142
Voted
ICDCSW
2007
IEEE
15 years 11 months ago
Using stream queries to measure communication performance of a parallel computing environment
We have developed a data stream management system that supports declarative stream queries running over high data volumes in a supercomputing environment. To enable specification ...
Erik Zeitler, Tore Risch
ISVLSI
2007
IEEE
131views VLSI» more  ISVLSI 2007»
15 years 11 months ago
Improving the Quality of Bounded Model Checking by Means of Coverage Estimation
Formal verification has become an important step in circuit and system design. A prominent technique is Bounded Model Checking (BMC) which is widely used in industry. In BMC it i...
Ulrich Kühne, Daniel Große, Rolf Drechs...