598 search results - page 70 / 120 » Note on parallel universes |
133
click to vote
SIGUCCS
2003
ACM
15 years 11 months ago
2003
ACM
After years of providing no-cost printing in its computing sites, the University of Delaware (UD) decided to move to a fee-based printing scheme for its student computing sites. T...
145
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Unexpectedly, the widespread availability of very very high speed (Broadband) bandwidth into communities and within large centres has become not only a long-term possibility but a...
183
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
171
click to vote
ISIPTA
1999
IEEE
15 years 10 months ago
1999
IEEE
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
173
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...