936 search results - page 173 / 188 » Task Graph Scheduling Using Timed Automata |
ASPDAC
2006
ACM
15 years 7 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
121
click to vote
ECIR
2011
Springer
14 years 4 months ago
2011
Springer
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
122
click to vote
AAAI
2008
15 years 3 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
DAC
1999
ACM
16 years 2 months ago
1999
ACM
? The economic viability of the reusable core-based design paradigm depends on the development of techniques for intellectual property protection. We introduce the first dynamic wa...
113
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
As sensor networks mature, there will be an increasing need for re-usable, dynamically taskable software systems that support multiple concurrent applications. In this paper, we c...