( en | de | ru )

 

Disambiguation of "Karim, Muhammad Rezaul"

Author of the publication

copydeleteadd this publication to your clipboard
Who Should Take This Task?: Dynamic Decision Support for Crowd Workers.

, , , and . ESEM, page 8:1-8:10. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Md Rezaul Karim Siddiky

Muhammad Muhammad

Laihem Karim

Measurement of the positron polarization at an helical undulator based positron source for the international linear collider ILC. HU Berlin, (2008)

Muhammad Al Muhammad

Mahmoud Karim

 

Other publications of authors with the same name

Wrapper/TAM Co-Optimization and Test Scheduling for SOCs Using Rectangle Bin Packing Considering Diagonal Length of Rectangles, , , , and . CoRR, (2010)Attributed Grammatical Evolution with Lookahead for the Multiple Knapsack Problem., and . Memetic Computing, 4 (4): 279-302 (2012)A New Approach to Constraint Weight Learning for Variable Ordering in CSPs.. CoRR, (2013)Building Toffoli Network for Reversible Logic Synthesis Based on Swapping Bit Strings, , , , , , and . CoRR, (2010)Degeneracy Reduction or Duplicate Elimination? An Analysis on the Performance of Attributed Grammatical Evolution with Lookahead to Solve the Multiple Knapsack Problem., and . NICSO, volume 387 of Studies in Computational Intelligence, page 247-266. Springer, (2011)On Some Properties of Doughnut Graphs., , and . IWOCA, volume 7643 of Lecture Notes in Computer Science, page 60-64. Springer, (2012)Sorting Network for Reversible Logic Synthesis, , , and . CoRR, (2010)Efficient Wrapper/TAM Co-Optimization for SOC Using Rectangle Packing, , , , and . CoRR, (2010)Sensitive ants are sensible ants., and . GECCO, page 775-782. ACM, (2012)On a Class of Planar Graphs with Straight-Line Grid Drawings on Linear Area., and . J. Graph Algorithms Appl., 13 (2): 153-177 (2009)