Sciweavers

47 search results - page 1 / 10
» Learning for Dynamic Assignments Reordering
Sort
View
ICTAI
2009
IEEE
13 years 11 months ago
Learning for Dynamic Assignments Reordering
In this paper a new learning scheme for SAT is proposed. The originality of our approach arises from its ability to achieve clause learning even if no conflict occurs. This clear...
Saïd Jabbour
CCR
2007
107views more  CCR 2007»
13 years 4 months ago
Dynamic load balancing without packet reordering
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, ho...
Srikanth Kandula, Dina Katabi, Shantanu Sinha, Art...
CP
2005
Springer
13 years 10 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
HCW
1999
IEEE
13 years 8 months ago
Multiple Cost Optimization for Task Assignment in Heterogeneous Computing Systems Using Learning Automata
A framework for task assignment in heterogeneous computing systems is presented in this work. The framework is based on a learning automata model. The proposed model can be used f...
Raju D. Venkataramana, N. Ranganathan
EOR
2007
102views more  EOR 2007»
13 years 4 months ago
Bucket brigades with worker learning
The dynamics and throughput of a bucket brigade production system is studied when workersÕ speeds increase due to learning. It is shown that, if the rules of the bucket brigade s...
Dieter Armbruster, Esma Senturk Gel, Junko Murakam...