3320 search results - page 142 / 664 » Heuristics for the Phylogeny Problem |
186
click to vote
DAM
2000
15 years 6 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
158
click to vote
CPAIOR
2007
Springer
16 years 22 days ago
2007
Springer
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome...
162
click to vote
IEAAIE
2001
Springer
15 years 11 months ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
179
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
— Test Pattern Generation for combinational circuits entails the identification of primary input assignments for detecting each fault in a set of target faults. An extension to ...
163
click to vote
ATMOS
2007
15 years 8 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...