discrete math arrays and binary relations -


given 2 arrays , b both of length m . given binary relation r. specify formally program determine whether corresponding elements of , b related relation r.

assuming testing whether a[i] r b[i]:

for i=1..m:   if not (a[i] r b[i]):     return false return true

Comments

Post a Comment

Popular posts from this blog

c# - IMAP GMAIL getting folder list problem -

i working on imap , trying list of folders in gmail account. i able working yahoo mail, not gmail. here's code: byte[] commandbytes = system.text.encoding.ascii.getbytes((("$ xlist \"\" \"*\" \r\n")).tochararray()); i had tried list well, it's not working. doing wrong? you cannot have space between "*" , trailing \r\n .
Read more

CUDA shared memory -

i need know cuda shared memory. let's assign 50 blocks 10 threads per block in g80 card. each sm processor of g80 can handle 8 blocks simultaneously. assume that, after doing calculations, shared memory occupied. what values in shared memory when next 8 new blocks arrive? previous values reside there? or previous values copied global memory , shared memory refreshed next 8 blocks? it states type qualifiers: variables in registers thread, stays in kernel variables in global memory thread, stays in kernel __device__ __shared__ type variable in shared memory block, stays in kernel __device__ type variable in global memory grid, stays until application exits __device__ __constant__ type variable grid, stays until application exits thus reference, answer question memory should refreshed next 8 blocks if reside in shared memory of device.
Read more