1257 search results - page 230 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
EUROPAR
2009
Springer
15 years 2 months ago
2009
Springer
Multicore architectures featuring specialized accelerators are getting an increasing amount of attention, and this success will probably influence the design of future High Perfor...
136
click to vote
FMSB
2008
14 years 11 months ago
2008
We introduce bounded asynchrony, a notion of concurrency tailored to the modeling of biological cell-cell interactions. Bounded asynchrony is the result of a scheduler that bounds ...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
109
click to vote
AAAI
1994
14 years 11 months ago
1994
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environ...
110
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A fuzzy logic algorithm has been developed that automatically allocates electronic attack (EA) resources distributed over different platforms in real-time. The controller must be ...