Sciweavers

3838 search results - page 395 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
QSIC
2006
IEEE
16 years 24 days ago
Static Slicing for Pervasive Programs
Pervasive programs should be context-aware, which means that program functions should react according to changing environmental conditions. Slicing, as an important class of code ...
Heng Lu, W. K. Chan, T. H. Tse
148
Voted
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
16 years 9 days ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
PAMI
2007
176views more  PAMI 2007»
15 years 6 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
GECCO
2005
Springer
174views Optimization» more  GECCO 2005»
16 years 9 days ago
Diversity as a selection pressure in dynamic environments
Evolutionary algorithms (EAs) are widely used to deal with optimization problems in dynamic environments (DE) [3]. When using EAs to solve DE problems, we are usually interested i...
Lam Thu Bui, Jürgen Branke, Hussein A. Abbass
ICC
2007
IEEE
203views Communications» more  ICC 2007»
16 years 1 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng