Sciweavers

19 search results - page 2 / 4
» Search Spaces for Min-Perturbation Repair
Sort
View
ICGA
1997
103views Optimization» more  ICGA 1997»
14 years 5 days ago
Genetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem c...
Vladimir N. Davidenko, Victor M. Kureichik, Victor...
STTT
2008
162views more  STTT 2008»
13 years 10 months ago
Coping with large design spaces: design problem solving in fluidic engineering
Abstract This paper is about tool support for knowledgeintensive engineering tasks. In particular, it introduces software technology to assist the design of complex technical syste...
Benno Stein
AIPS
2004
14 years 7 days ago
Guiding Planner Backjumping Using Verifier Traces
In this paper, we show how a planner can use a modelchecking verifier to guide state space search. In our work on hard real-time, closed-loop planning, we use a modelchecker'...
Robert P. Goldman, Michael J. S. Pelican, David J....
VLSID
2006
IEEE
112views VLSI» more  VLSID 2006»
14 years 4 months ago
Handling Constraints in Multi-Objective GA for Embedded System Design
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...
Biman Chakraborty, Ting Chen, Tulika Mitra, Abhik ...
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
14 years 5 months ago
Anytime, Dynamic Planning in High-dimensional Search Spaces
— We present a sampling-based path planning and replanning algorithm that produces anytime solutions. Our algorithm tunes the quality of its result based on available search time...
Dave Ferguson, Anthony Stentz