Sciweavers

867 search results - page 104 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CIE
2007
Springer
14 years 2 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Linear Sum Capacity for Gaussian Multiple Access Channels with Feedback
The capacity region of the N-sender additive white Gaussian noise (AWGN) multiple access channel (MAC) with feedback is not known in general, despite significant contributions by C...
Ehsan Ardestanizadeh, Michele A. Wigger, Young-Han...
ICCAD
2003
IEEE
124views Hardware» more  ICCAD 2003»
14 years 4 months ago
Gradual Relaxation Techniques with Applications to Behavioral Synthesis
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
Zhiru Zhang, Yiping Fan, Miodrag Potkonjak, Jason ...
CCE
2010
13 years 5 months ago
Combined mass and energy integration in process design at the example of membrane-based gas separation systems
This paper presents an approach for combined mass and energy integration in process synthesis and illustrates it at the thermochemical production of crude synthetic natural gas (S...
Martin Gassner, François Maréchal
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
14 years 2 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers