Sciweavers

514 search results - page 8 / 103
» On enumerating all minimal solutions of feedback problems
Sort
View
DAM
2000
137views more  DAM 2000»
13 years 7 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
CPHYSICS
2006
182views more  CPHYSICS 2006»
13 years 7 months ago
MinFinder: Locating all the local minima of a function
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
Ioannis G. Tsoulos, Isaac E. Lagaris
CP
2005
Springer
14 years 27 days ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
13 years 11 months ago
Closed form solution to simultaneous buffer insertion/sizing and wire sizing
In this paper, we consider the delay minimization problem of a wire by simultaneously considering bu er insertion, bu er sizing and wire sizing. We consider three versions of the ...
Chris C. N. Chu, D. F. Wong
JSAC
2006
88views more  JSAC 2006»
13 years 7 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel