Sciweavers

4539 search results - page 198 / 908
» Approaches to Compute Workflow Complexity
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Bayesian topic models for describing computer network behaviors
We consider the use of Bayesian topic models in the analysis of computer network traffic. Our approach utilizes latent Dirichlet allocation and time-varying dynamic latent Dirich...
Christopher Cramer, Lawrence Carin
143
Voted
SCOPES
2007
Springer
15 years 10 months ago
Optimization of dynamic data structures in multimedia embedded systems using evolutionary computation
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applicatio...
David Atienza, Christos Baloukas, Lazaros Papadopo...
UIALL
2004
Springer
15 years 9 months ago
A Framework for Context-Sensitive Coordination of Human Interruptions in Human-Computer Interaction
Abstract. Recent trends in software development directed toward intelligence, distribution, and mobility need to be followed by an increased sophistication in user interface design...
Sonja Gievska, John L. Sibert
LPNMR
1997
Springer
15 years 8 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 8 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...