1272 search results - page 102 / 255 » The Set Cover with Pairs Problem |
116
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
157
click to vote
ECCC
2007
15 years 18 days ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
134
Voted
BMCBI
2007
15 years 24 days ago
2007
Background: Much recent work in bioinformatics has focused on the inference of various types of biological networks, representing gene regulation, metabolic processes, protein-pro...
91
Voted
CASES
2010
ACM
14 years 10 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
103
Voted
ACSC
2005
IEEE
15 years 6 months ago
2005
IEEE
We present a simple approach for implementing flexible locking strategies in a system of components, which may themselves be composite objects. The approach is flexible in that a ...