Sciweavers

810 search results - page 27 / 162
» Defining implicit objective functions for design problems
Sort
View
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
14 years 19 days ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
TCAD
2002
110views more  TCAD 2002»
13 years 8 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
MICCAI
2004
Springer
14 years 9 months ago
Border Detection on Short Axis Echocardiographic Views Using a Region Based Ellipse-Driven Framework
In this paper, we propose a robust technique that integrates spatial and temporal information for consistent recovery of the endocardium. To account for the low image quality we in...
Maxime Taron, Nikos Paragios, Marie-Pierre Jolly
SIAMCO
2002
81views more  SIAMCO 2002»
13 years 8 months ago
Optimality Conditions for Irregular Inequality-Constrained Problems
Abstract. We consider feasible sets given by conic constraints, where the cone defining the constraints is convex with nonempty interior. We study the case where the feasible set i...
Alexey F. Izmailov, Mikhail V. Solodov
ACSE
2000
ACM
14 years 1 months ago
Concurrency, objects and visualisation
Object-oriented programming and concurrency are increasingly popular in computing education. Both are difficult topics in themselves, and the combination of both introduces subtle...
Chris Exton, Michael Kölling