Sciweavers

2040 search results - page 202 / 408
» Approximate Expectation Maximization
Sort
View
123
Voted
CCE
2004
15 years 3 months ago
A strategy for MINLP synthesis of flexible and operable processes
This paper presents a sequential two-stage strategy for the stochastic synthesis of chemical processes in which flexibility and ability to adjust manipulated variables are taken i...
Zorka Novak Pintaric, Zdravko Kravanja
143
Voted
CODES
2010
IEEE
15 years 1 months ago
Dynamic, non-linear cache architecture for power-sensitive mobile processors
Today, mobile smartphones are expected to be able to run the same complex, algorithm-heavy, memory-intensive applications that were originally designed and coded for generalpurpos...
Garo Bournoutian, Alex Orailoglu
180
Voted
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
15 years 1 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
WWW
2010
ACM
15 years 10 months ago
Diversifying web search results
Result diversity is a topic of great importance as more facets of queries are discovered and users expect to find their desired facets in the first page of the results. However,...
Davood Rafiei, Krishna Bharat, Anand Shukla
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
15 years 5 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...