Sciweavers

15073 search results - page 246 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
MP
1998
105views more  MP 1998»
15 years 4 months ago
Capacitated facility location: Separation algorithms and computational experience
We consider the polyhedral approach to solving the capacitated facility location problem. The valid inequalities considered are the knapsack, ow cover, e ective capacity, single d...
Karen Aardal
RTCSA
2009
IEEE
15 years 11 months ago
Managing Imprecise Worst Case Execution Times on DVFS Platforms
Abstract—Although energy-efficient real-time task scheduling has attracted a lot of attention in the past decade, most existing results assumed deterministic execution lengths f...
Vandy Berten, Chi-Ju Chang, Tei-Wei Kuo
AUSDM
2007
Springer
145views Data Mining» more  AUSDM 2007»
15 years 10 months ago
Discovering Frequent Sets from Data Streams with CPU Constraint
Data streams are usually generated in an online fashion characterized by huge volume, rapid unpredictable rates, and fast changing data characteristics. It has been hence recogniz...
Xuan Hong Dang, Wee Keong Ng, Kok-Leong Ong, Vince...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
16 years 1 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 10 months ago
Population-based incremental learning with memory scheme for changing environments
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
Shengxiang Yang