Sciweavers

11371 search results - page 105 / 2275
» The network inhibition problem
Sort
View
DSN
2006
IEEE
16 years 15 days ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
SOFSEM
2009
Springer
16 years 3 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
NDSS
1998
IEEE
15 years 10 months ago
On the Problem of Trust in Mobile Agent Systems
Systems that support mobile agents are increasingly being used on the global Internet. Security concerns dealing with the protection of the execution environment from malicious ag...
Uwe G. Wilhelm, Sebastian Staamann, Levente Butty&...
EDM
2010
165views Data Mining» more  EDM 2010»
15 years 7 months ago
Using a Bayesian Knowledge Base for Hint Selection on Domain Specific Problems
A Bayesian Knowledge Base is a generalization of traditional Bayesian Networks where nodes or groups of nodes have independence. In this paper we describe a method of generating a ...
John C. Stamper, Tiffany Barnes, Marvin J. Croy
AIPS
2004
15 years 7 months ago
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic searc...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...