Sciweavers

1927 search results - page 326 / 386
» UMDAs for dynamic optimization problems
Sort
View
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
15 years 4 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
15 years 4 months ago
Pareto-coevolutionary genetic programming classifier
The conversion and extension of the Incremental ParetoCoevolution Archive algorithm (IPCA) into the domain of Genetic Programming classifier evolution is presented. In order to ac...
Michal Lemczyk, Malcolm I. Heywood
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 4 months ago
Inference of genetic networks using S-system: information criteria for model selection
In this paper we present an evolutionary approach for inferring the structure and dynamics in gene circuits from observed expression kinetics. For representing the regulatory inte...
Nasimul Noman, Hitoshi Iba
99
Voted
PLDI
2009
ACM
15 years 7 months ago
Binary analysis for measurement and attribution of program performance
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
Nathan R. Tallent, John M. Mellor-Crummey, Michael...
111
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Load Balancing in Large-Scale RFID Systems
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
Qunfeng Dong, Ashutosh Shukla, Vivek Shrivastava, ...