10106 search results - page 180 / 2022 » Algorithm Selection and Scheduling |
181
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
181
click to vote
GECCO
2000
Springer
15 years 10 months ago
2000
Springer
This paper discusses the issues that arise in the design and implementation of an industrialstrength evolutionary-based system for the optimization of the monthly work schedules f...
200
click to vote
ISPDC
2005
IEEE
16 years 2 days ago
2005
IEEE
Abstract— In this article, we propose a fully distributed algorithm for finding all primes in an given interval [2..n] (or (L, R), more generally), based on the SMER — Schedul...
132
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...
154
click to vote
ICNS
2007
IEEE
16 years 24 days ago
2007
IEEE
— Short flow first scheduling (SFF) strategy is effective in obtaining more stringent performance bounds for short flows in Internet. However, previous strict SFF approaches i...