Sciweavers

526 search results - page 19 / 106
» Efficient Algorithms for Online Decision Problems
Sort
View
AIPS
2000
13 years 11 months ago
On-line Scheduling via Sampling
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong
CIKM
2008
Springer
14 years 4 days ago
Content-based filtering for efficient online materialized view maintenance
Real-time materialized view maintenance has become increasingly popular, especially in real-time data warehousing and data streaming environments. Upon updates to base relations, ...
Gang Luo, Philip S. Yu
EVOW
2009
Springer
14 years 2 months ago
Efficient Signal Processing and Anomaly Detection in Wireless Sensor Networks
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...
Markus Wälchli, Torsten Braun
SOFSEM
2010
Springer
14 years 7 months ago
Regret Minimization and Job Scheduling
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
Yishay Mansour
JSS
2010
104views more  JSS 2010»
13 years 5 months ago
Using hybrid algorithm for Pareto efficient multi-objective test suite minimisation
Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considere...
Shin Yoo, Mark Harman