Sciweavers

1984 search results - page 106 / 397
» The colourful feasibility problem
Sort
View
CISS
2008
IEEE
14 years 4 months ago
Subgradient methods in network resource allocation: Rate analysis
— We consider dual subgradient methods for solving (nonsmooth) convex constrained optimization problems. Our focus is on generating approximate primal solutions with performance ...
Angelia Nedic, Asuman E. Ozdaglar
MICAI
2007
Springer
14 years 4 months ago
Handling Constraints in Particle Swarm Optimization Using a Small Population Size
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
Juan Carlos Fuentes Cabrera, Carlos A. Coello Coel...
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
14 years 2 months ago
Robust optimization based backtrace method for analog circuits
In this paper, we propose a new robust approach to signal backtrace for efficiently testing embedded analog modules in a large system. The proposed signal backtrace method is form...
Alfred V. Gomes, Abhijit Chatterjee
DEDS
2010
88views more  DEDS 2010»
13 years 10 months ago
Optimal Admission Control of Discrete Event Systems with Real-Time Constraints
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...
Jianfeng Mao, Christos G. Cassandras
JCST
2008
142views more  JCST 2008»
13 years 10 months ago
New Information Distance Measure and Its Application in Question Answering System
In a question answering (QA) system, the fundamental problem is how to measure the distance between a question and an answer, hence ranking different answers. We demonstrate that s...
Xian Zhang, Yu Hao, Xiaoyan Zhu, Ming Li