Sciweavers

3656 search results - page 276 / 732
» Compact Location Problems
Sort
View
EVOW
2006
Springer
15 years 10 months ago
The Trade Off Between Diversity and Quality for Multi-objective Workforce Scheduling
In this paper we investigate and compare multi-objective and weighted single objective approaches to a real world workforce scheduling problem. For this difficult problem we consid...
Peter I. Cowling, Nic Colledge, Keshav P. Dahal, S...
TMC
2008
161views more  TMC 2008»
15 years 6 months ago
A New MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks
Abstract--In wireless ad hoc networks, in addition to the well-known hidden terminal and exposed terminal problems, the locationdependent contention may cause serious unfairness an...
Ping Wang, Hai Jiang, Weihua Zhuang
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 5 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
169
Voted
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 6 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
AB
2007
Springer
15 years 10 months ago
Efficient Haplotype Inference with Pseudo-boolean Optimization
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
Ana Graça, João Marques-Silva, In&ec...