Sciweavers

3379 search results - page 202 / 676
» Parallel cross-entropy optimization
Sort
View
DAGSTUHL
2007
13 years 11 months ago
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
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...
Leah Epstein
DEDS
2010
108views more  DEDS 2010»
13 years 7 months ago
Timing Control of Switched Systems with Applications to Robotic Marionettes
Abstract We present an optimal timing control formulation for the problem of controlling autonomous puppets. In particular, by appropriately timing the different movements, entire ...
Patrick Martin, Magnus Egerstedt
IEEESCC
2007
IEEE
14 years 3 months ago
Swift: Fast, Reliable, Loosely Coupled Parallel Computation
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...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 3 months ago
Increased Bit-Parallelism for Approximate String Matching
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...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
MST
2000
57views more  MST 2000»
13 years 9 months ago
On Scheduling Parallel Tasks at Twilight
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...
Hannah Bast