Sciweavers

8695 search results - page 1412 / 1739
» Making the Complex Simple
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 8 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
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 8 months ago
Crossover: the divine afflatus in search
The traditional GA theory is pillared on the Building Block Hypothesis (BBH) which states that Genetic Algorithms (GAs) work by discovering, emphasizing and recombining low order ...
David Iclanzan
ATAL
2006
Springer
15 years 8 months ago
Gradient field-based task assignment in an AGV transportation system
Assigning tasks to agents is complex, especially in highly dynamic environments. Typical protocol-based approaches for task assignment such as Contract Net have proven their value...
Danny Weyns, Nelis Boucké, Tom Holvoet
COMSWARE
2006
IEEE
15 years 8 months ago
Architecting protocol stack optimizations on mobile devices
Applications using traditional protocol stacks (e.g TCP/IP) from wired networks do not function efficiently in mobile wireless scenarios. This is primarily due to the layered archi...
Vijay T. Raisinghani, Sridhar Iyer
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 8 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
« Prev « First page 1412 / 1739 Last » Next »