936 search results - page 111 / 188 » Task Graph Scheduling Using Timed Automata |
109
click to vote
HYBRID
2010
Springer
15 years 8 months ago
2010
Springer
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
121
click to vote
COMCOM
2006
15 years 1 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
123
click to vote
AAMAS
2000
Springer
15 years 1 months ago
2000
Springer
Hospital Patient Scheduling is an inherently distributed problem because of the way real hospitals are organized. As medical procedures have become more complex, and their associat...
110
click to vote
WDAG
2010
Springer
14 years 12 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
117
click to vote
AMAI
1999
Springer
15 years 1 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...