Sciweavers

1299 search results - page 111 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
CCGRID
2005
IEEE
16 years 10 days ago
Task scheduling strategies for workflow-based applications in grids
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing ...
James Blythe, S. Jain, Ewa Deelman, Yolanda Gil, K...
ICCAD
2004
IEEE
94views Hardware» more  ICCAD 2004»
16 years 3 months ago
Timing macro-modeling of IP blocks with crosstalk
With the increase of design complexities and the decrease of minimal feature sizes, IP reuse is becoming a common practice while crosstalk is becoming a critical issue that must b...
Ruiming Chen, Hai Zhou
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
16 years 1 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
16 years 1 months ago
Performance aware secure code partitioning
Many embedded applications exist where decisions are made using sensitive information. A critical issue in such applications is to ensure that data is accessed only by authorized ...
Sri Hari Krishna Narayanan, Mahmut T. Kandemir, Ri...
AIPS
2009
15 years 7 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen