Sciweavers

603 search results - page 40 / 121
» A General Approximation Technique for Constrained Forest Pro...
Sort
View
CP
2006
Springer
15 years 5 months ago
Inner and Outer Approximations of Existentially Quantified Equality Constraints
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
Alexandre Goldsztejn, Luc Jaulin
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
15 years 10 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...
ATAL
2007
Springer
15 years 7 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 7 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
14 years 11 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li