4565 search results - page 228 / 913 » Time Optimal Self-Stabilizing Algorithms |
114
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
88
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Web services are rapidly changing the landscape of software engineering. One of the most interesting challenges introduced by web services is represented by Quality Of Service (Qo...
87
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
110
Voted
TON
2008
15 years 16 days ago
2008
Abstract-- We consider a one-hop wireless network with independent time varying channels and N users, such as a multiuser uplink or downlink. We first show that general classes of ...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...