Sciweavers

152 search results - page 9 / 31
» Discovering Identity Problems: A Case Study
Sort
View
107
Voted
JCO
2008
102views more  JCO 2008»
14 years 11 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
102
Voted
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
14 years 11 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
73
Voted
SOUPS
2005
ACM
15 years 5 months ago
Stopping spyware at the gate: a user study of privacy, notice and spyware
Spyware is a significant problem for most computer users. The term “spyware” loosely describes a new class of computer software. This type of software may track user activitie...
Nathaniel Good, Rachna Dhamija, Jens Grossklags, D...
105
Voted
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
15 years 4 months ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
Abel Garcia-Najera, John A. Bullinaria
85
Voted
IFM
1999
Springer
15 years 3 months ago
Integration Problems in Telephone Feature Requirements
The feature interaction problem is prominent in telephone service development. Through a number of case studies, we have discovered that no single semantic framework is suitable f...
J. Paul Gibson, Geoff Hamilton, Dominique Mé...