Sciweavers

7380 search results - page 408 / 1476
» time 2008
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
15 years 6 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
TSMC
2002
91views more  TSMC 2002»
15 years 6 months ago
On the sure criticality of tasks in activity networks with imprecise durations
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
Stefan Chanas, Didier Dubois, Pawel Zielinski
MICS
2010
137views more  MICS 2010»
15 years 5 months ago
Finding Range Minima in the Middle: Approximations and Applications
Abstract. A Range Minimum Query asks for the position of a minimal element between two specified array-indices. We consider a natural extension of this, where our further constrai...
Johannes Fischer, Volker Heun
PVLDB
2010
151views more  PVLDB 2010»
15 years 5 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh
DATE
2008
IEEE
110views Hardware» more  DATE 2008»
16 years 1 months ago
Run-time System for an Extensible Embedded Processor with Dynamic Instruction Set
One of the upcoming challenges in embedded processing is to incorporate an increasing amount of adaptivity in order to respond to the multifarious constraints induced by today’s...
Lars Bauer, Muhammad Shafique, Stephanie Kreutz, J...