3320 search results - page 397 / 664 » Heuristics for the Phylogeny Problem |
153
click to vote
MP
2010
15 years 5 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
181
click to vote
MASS
2010
15 years 4 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
176
click to vote
SIGSOFT
2010
ACM
15 years 4 months ago
2010
ACM
Concurrent programs are notoriously difficult to debug. We see two main reasons for this: 1) concurrency bugs are often difficult to reproduce, 2) traces of buggy concurrent execu...
198
click to vote
TCBB
2011
15 years 1 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
154
click to vote
TR
2010
15 years 1 months ago
2010
Redundancy allocation problems (RAPs) have attracted much attention for the past thirty years due to its wide applications in improving the reliability of various engineering syste...