Sciweavers

43 search results - page 3 / 9
» Integer Exact Network Synthesis Problem
Sort
View
SAINT
2008
IEEE
15 years 4 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two diff...
Markus Leitner, Günther R. Raidl
82
Voted
CCE
2004
14 years 9 months ago
Solving heat exchanger network synthesis problems with Tabu Search
: This paper describes the implementation of a meta-heuristic optimization approach, Tabu Search (TS), for Heat Exchanger Networks (HEN) synthesis and compares this approach to oth...
B. Lin, D. C. Miller
CANDC
2005
ACM
14 years 9 months ago
Integer linear programming as a tool for constructing trees from quartet data
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
Jan Weyer-Menkhoff, Claudine Devauchelle, Alexande...
IPPS
2006
IEEE
15 years 3 months ago
Solving generic role assignment exactly
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
Christian Frank, Kay Römer
ICCAD
2005
IEEE
144views Hardware» more  ICCAD 2005»
15 years 6 months ago
An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
Paulo F. Flores, José C. Monteiro, Eduardo ...