Sciweavers

975 search results - page 120 / 195
» Locality Optimization for Program Instances
Sort
View
ATAL
2007
Springer
14 years 3 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
14 years 2 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
ECOOP
2007
Springer
14 years 1 months ago
AS-GC: An Efficient Generational Garbage Collector for Java Application Servers
Abstract. A generational collection strategy utilizing a single nursery cannot efficiently manage objects in application servers due to variance in their lifespans. In this paper, ...
Feng Xian, Witawas Srisa-an, ChengHuan Jia, Hong J...
LION
2009
Springer
135views Optimization» more  LION 2009»
14 years 3 months ago
Neural Network Pairwise Interaction Fields for Protein Model Quality Assessment
We present a new knowledge-based Model Quality Assessment Program (MQAP) at the residue level which evaluates single protein structure models. We use a tree representation of the ...
Alberto J. M. Martin, Alessandro Vullo, Gianluca P...
GECCO
2008
Springer
132views Optimization» more  GECCO 2008»
13 years 10 months ago
Subheuristic search and scalability in a hyperheuristic
Our previous work has introduced a hyperheuristic (HH) approach based on Genetic Programming (GP). There, GP employs usergiven languages where domain-specific local heuristics ar...
Robert E. Keller, Riccardo Poli