Sciweavers

12950 search results - page 478 / 2590
» On Optimal Timed Strategies
Sort
View
AAAI
2008
15 years 9 months ago
Optimal Scheduling of Contract Algorithms with Soft Deadlines
A contract algorithm is an algorithm which is given, as part of its input, a specified amount of allowable computation time. In contrast, interruptible algorithms may be interrupt...
Spyros Angelopoulos, Alejandro López-Ortiz,...
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
15 years 8 months ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein
ECAI
2004
Springer
16 years 13 days ago
Piece-Wise Model Fitting Using Local Data Patterns
In this paper we propose a novel classification algorithm that fits models of different complexity on separate regions of the input space. The goal is to achieve a balance betwee...
Ricardo Vilalta, Murali-Krishna Achari, Christoph ...
ESTIMEDIA
2004
Springer
16 years 13 days ago
Trace-based evaluation of clock synchronization algorithms for wireless loudspeakers
We present an evaluation strategy for clock synchronization algorithms. It is based on a combination of measured traces, which provide for realistic performance estimation, and of...
Philipp Blum, Lothar Thiele
LWA
2008
15 years 8 months ago
Weighted Voting as Approximate MAP Prediction in Pairwise Classification
Weighted voting is the commonly used strategy for combining predictions in pairwise classification. Even though it shows excellent performance in practice, it is often criticized ...
Eyke Hüllermeier, Stijn Vanderlooy