Sciweavers

1984 search results - page 39 / 397
» The colourful feasibility problem
Sort
View
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
14 years 4 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason
SCL
2008
56views more  SCL 2008»
13 years 9 months ago
A new vertex result for robustness problems with interval matrix uncertainty
This paper1 addresses a family of robustness problems in which the system under consideration is affected by interval matrix uncertainty. The main contribution of the paper is a n...
Teodoro Alamo, Roberto Tempo, Daniel R. Ramí...
DATE
2002
IEEE
95views Hardware» more  DATE 2002»
14 years 2 months ago
A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem
Abstract—Antenna problem is a phenomenon of plasma-induced gateoxide degradation. It directly affects manufacturability of very large scale integration (VLSI) circuits, especiall...
Li-Da Huang, Xiaoping Tang, Hua Xiang, D. F. Wong,...
GECCO
2004
Springer
122views Optimization» more  GECCO 2004»
14 years 3 months ago
An Improved Diversity Mechanism for Solving Constrained Optimization Problems Using a Multimembered Evolution Strategy
This paper presents an improved version of a simple evolution strategy (SES) to solve global nonlinear optimization problems. As its previous version, the approach does not require...
Efrén Mezura-Montes, Carlos A. Coello Coell...
AIPS
2006
13 years 11 months ago
Looking for Shortcuts: Infeasible Search Analysis for Oversubscribed Scheduling Problems
Searches that include both feasible and infeasible solutions have proved to be efficient algorithms for solving some scheduling problems. Researchers conjecture that these algorit...
Mark F. Rogers, Adele E. Howe, Darrell Whitley