Sciweavers

99 search results - page 2 / 20
» Scott's problem for Proper Scott sets
Sort
View
ANOR
2007
108views more  ANOR 2007»
13 years 5 months ago
Towards a practical engineering tool for rostering
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...
Edward P. K. Tsang, John A. Ford, Patrick Mills, R...
TACAS
2010
Springer
251views Algorithms» more  TACAS 2010»
13 years 11 months ago
Approximating the Pareto Front of Multi-criteria Optimization Problems
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
Julien Legriel, Colas Le Guernic, Scott Cotton, Od...
SIAMCOMP
2000
85views more  SIAMCOMP 2000»
13 years 5 months ago
Binary Space Partitions for Fat Rectangles
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R3 such that the aspect...
Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, ...
JGT
2011
76views more  JGT 2011»
13 years 22 days ago
Intersections of graphs
Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this paper is to provide som...
Béla Bollobás, Alex D. Scott
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 6 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson