263 search results - page 26 / 53 » Regret Bounds for Prediction Problems |
138
click to vote
NIPS
2008
15 years 7 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
151
click to vote
AIPS
2008
15 years 8 months ago
2008
We address the problem of coordinating the plans and schedules for a team of agents in an uncertain and dynamic environment. Bounded rationality, bounded communication, subjectivi...
247
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
Embedded control systems with hard real-time constraints require that deadlines are met at all times or the system may malfunction with potentially catastrophic consequences. Sched...
161
click to vote
IPPS
2007
IEEE
16 years 9 days ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
159
click to vote
ANSS
2000
IEEE
15 years 10 months ago
2000
IEEE
The abilityto predict the performance of a simulationapplicationbefore its implementationis an important factor to the adoption of parallel simulation technology in industry. Idea...