6142 search results - page 593 / 1229 » The Complexity of Partition Functions |
189
click to vote
PATAT
1997
Springer
15 years 11 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...
219
click to vote
INFOCOM
1993
IEEE
15 years 11 months ago
1993
IEEE
We propose a new service discipline, called the RateControlledStatic-Priority (RCSP) queueingdiscipline, that can provide throughput, delay, delay jitter, and loss free guarantees...
287
click to vote
COLT
1992
Springer
15 years 11 months ago
1992
Springer
This paper deals with finite size networks which consist of interconnections of synchronously evolving processors. Each processor updates its state by applying a "sigmoidal&q...
215
click to vote
LNCS
1993
15 years 11 months ago
1993
– In the past few years considerable demand for user oriented multimedia information systems has developed. These systems must provide a rich set of functionality so that new, co...
171
click to vote
SIGGRAPH
1989
ACM
15 years 11 months ago
1989
ACM
This paper will examine hypertexture rendering techniques and will demonstrate how volume data sets may be adapted in order for hypertexture to be applied. Details are given of a c...