Sciweavers

1197 search results - page 114 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
ICCAD
1994
IEEE
134views Hardware» more  ICCAD 1994»
14 years 13 days ago
Boolean constrained encoding: a new formulation and a case study
1 This paper provides a new, generalized approach to the problem of encoding information as vectors of binary digits. We furnish a formal definition for the Boolean constrained enc...
Ney Laert Vilar Calazans
BROADNETS
2005
IEEE
14 years 1 months ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
CORR
2010
Springer
168views Education» more  CORR 2010»
13 years 8 months ago
Penalty Decomposition Methods for Rank Minimization
In this paper we consider general rank minimization problems with rank appearing in either objective function or constraint. We first show that a class of matrix optimization prob...
Zhaosong Lu, Yong Zhang
BMCBI
2006
194views more  BMCBI 2006»
13 years 8 months ago
Novel metaheuristic for parameter estimation in nonlinear dynamic biological systems
Background: We consider the problem of parameter estimation (model calibration) in nonlinear dynamic models of biological systems. Due to the frequent ill-conditioning and multi-m...
Maria Rodriguez-Fernandez, Jose A. Egea, Julio R. ...
SDM
2007
SIAM
184views Data Mining» more  SDM 2007»
13 years 9 months ago
Mining Naturally Smooth Evolution of Clusters from Dynamic Data
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
Yi Wang, Shi-Xia Liu, Jianhua Feng, Lizhu Zhou