359 search results - page 37 / 72 » Order Scheduling Models: Hardness and Algorithms |
ICDT
2009
ACM
14 years 8 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
DATE
2011
IEEE
12 years 11 months ago
2011
IEEE
Current processors are optimized for average case performance, often leading to a high worst-case execution time (WCET). Many architectural features that increase the average case...
TON
2010
13 years 2 months ago
2010
With the fast progress of MIMO technology and its growing applications in networks, it is important to develop techniques to enable more efficient MIMO network communications. Howe...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
JAIR
2008
13 years 7 months ago
2008
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...