Sciweavers

5624 search results - page 140 / 1125
» On Conditional Covering Problem
Sort
View
BMCBI
2008
150views more  BMCBI 2008»
15 years 6 months ago
13C labeling experiments at metabolic nonstationary conditions: An exploratory study
Background: Stimulus Response Experiments to unravel the regulatory properties of metabolic networks are becoming more and more popular. However, their ability to determine enzyme...
Sebastian Aljoscha Wahl, Katharina Nöh, Wolfg...
BMCBI
2005
134views more  BMCBI 2005»
15 years 6 months ago
Ancestral sequence alignment under optimal conditions
Background: Multiple genome alignment is an important problem in bioinformatics. An important subproblem used by many multiple alignment approaches is that of aligning two multipl...
Alexander K. Hudek, Daniel G. Brown 0001
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
Termination Detection of Local Computations
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
Emmanuel Godard, Yves Métivier, Gerard Tel
EOR
2007
90views more  EOR 2007»
15 years 6 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
SAC
1997
ACM
15 years 10 months ago
Crozzle: an NP-complete problem
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
David Binkley, Bradley M. Kuhn