Sciweavers

16188 search results - page 2723 / 3238
» The Optimal PAC Algorithm
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 11 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 11 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 10 months ago
Evolving distributed agents for managing air traffic
Air traffic management offers an intriguing real world challenge to designing large scale distributed systems using evolutionary computation. The ability to evolve effective air t...
Adrian K. Agogino, Kagan Tumer
DAC
2004
ACM
15 years 10 months ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 10 months ago
Polyhedral Code Generation in the Real World
The polyhedral model is known to be a powerful framework to reason about high level loop transformations. Recent developments in optimizing compilers broke some generally accepted ...
Nicolas Vasilache, Cédric Bastoul, Albert C...
« Prev « First page 2723 / 3238 Last » Next »