Sciweavers

3206 search results - page 289 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
CEC
2009
IEEE
15 years 8 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
SIGMETRICS
2008
ACM
128views Hardware» more  SIGMETRICS 2008»
15 years 3 months ago
Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation
Local network coding is growing in prominence as a technique to facilitate greater capacity utilization in multi-hop wireless networks. A specific objective of such local network ...
Shravan K. Rayanchu, Sayandeep Sen, Jianming Wu, S...
AIED
2007
Springer
15 years 7 months ago
Optimizing Student Models for Causality
Complex student models often include key parameters critical to their behavior and effectiveness. For example, one meta-cognitive model of student help-seeking in intelligent tutor...
Benjamin Shih, Kenneth R. Koedinger, Richard Schei...
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 3 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang
162
Voted
ALT
2002
Springer
16 years 11 days ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky