1184 search results - page 162 / 237 » Memory Design for Constrained Dynamic Optimization Problems |
104
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
117
click to vote
AAAI
2007
15 years 4 months ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
103
click to vote
FMSD
2007
15 years 1 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...
110
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
ICCNMC
2005
Springer
15 years 7 months ago
2005
Springer
— In this paper, we address a sensor network lifetime problem that maintains a certain throughput in an environment where physical node destruction is possible. While lifetime is...