1191 search results - page 102 / 239 » Completeness and Performance Of The APO Algorithm |
106
click to vote
ADC
2003
Springer
15 years 3 months ago
2003
Springer
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
MFCS
2001
Springer
15 years 2 months ago
2001
Springer
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
ECRTS
2005
IEEE
15 years 3 months ago
2005
IEEE
Markov-Chain (MC) based constraints have been shown to be an effective QoS measure for a class of real-time systems, particularly those arising from control applications. Scheduli...
DAGSTUHL
2008
14 years 11 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...