Sciweavers

870 search results - page 55 / 174
» A New Approach to Modeling and Solving Minimal Perturbation ...
Sort
View
NIPS
2007
13 years 10 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
14 years 25 days ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
QOSIP
2005
Springer
14 years 2 months ago
Topological Design of Survivable IP Networks Using Metaheuristic Approaches
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
Emílio C. G. Wille, Marco Mellia, Emilio Le...
CPAIOR
2006
Springer
14 years 27 days ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter