Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
Abstract We present an optimal timing control formulation for the problem of controlling autonomous puppets. In particular, by appropriately timing the different movements, entire ...
A common pattern in scientific computing involves the execution of many tasks that are coupled only in the sense that the output of one may be passed as input to one or more other...
Yong Zhao, Mihael Hategan, Ben Clifford, Ian T. Fo...
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...