11371 search results - page 124 / 2275 » The network inhibition problem |
177
click to vote
ICCS
2003
Springer
15 years 11 months ago
2003
Springer
Biomedical systems involve complex interactions between diverse components. Problem solving in such systems requires insight, i.e. the capability to make non-obvious connections. I...
150
click to vote
COR
2008
15 years 6 months ago
2008
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
169
click to vote
ORL
1998
15 years 6 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
184
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
166
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...