Sciweavers

2914 search results - page 399 / 583
» Optimization by Stochastic Continuation
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 12 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
ITS
2004
Springer
155views Multimedia» more  ITS 2004»
15 years 12 months ago
Modeling the Development of Problem Solving Skills in Chemistry with a Web-Based Tutor
This research describes a probabilistic approach for developing predictive models of how students learn problem-solving skills in general qualitative chemistry. The goal is to use ...
Ron Stevens, Amy Soller, Melanie Cooper, Marcia Sp...
ISCAS
2003
IEEE
128views Hardware» more  ISCAS 2003»
15 years 11 months ago
Placement with symmetry constraints for analog layout using red-black trees
– The traditional way of approaching placement problems in computer-aided design (CAD) tools for analog layout is to explore an extremely large search space of feasible or unfeas...
Sarat C. Maruvada, Karthik Krishnamoorthy, Subodh ...
IPPS
2002
IEEE
15 years 11 months ago
Model-Based Control of Adaptive Applications: An Overview
Model-based control utilizes performance models of applications to choose performant system configurations for execution of applications. The performance models used in this resea...
Vikram S. Adve, Afolami Akinsanmi, James C. Browne...

Publication
216views
15 years 11 months ago
Dynamic Matching with a Fall-Back Option
We study dynamic matching without money when one side of the market is dynamic with arrivals and de- partures and the other is static and agents have strict prefer- ences over a...
Sujit Gujar, David Parkes