Sciweavers

641 search results - page 78 / 129
» On robust online scheduling algorithms
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 8 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
STACS
2005
Springer
14 years 1 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
IJCNN
2006
IEEE
14 years 2 months ago
Dynamic Hyperparameter Scaling Method for LVQ Algorithms
— We propose a new annealing method for the hyperparameters of several recent Learning Vector Quantization algorithms. We first analyze the relationship between values assigned ...
Sambu Seo, Klaus Obermayer
SAC
2008
ACM
13 years 7 months ago
Expected energy consumption minimization in DVS systems with discrete frequencies
Energy-efficiency has been an important system issue in hardware and software designs to extend operation duration or cut power bills. This research explores systems with probabil...
Jian-Jia Chen
EMSOFT
2010
Springer
13 years 6 months ago
Resource adaptations with servers for hard real-time systems
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...
Nikolay Stoimenov, Lothar Thiele, Luca Santinelli,...