837 search results - page 81 / 168 » Hard combinators |
108
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--A delay-constrained scheduling problem for pointto-point communication is considered: a packet of B bits must be transmitted by a hard deadline of T slots over a timevary...
128
Voted
EOR
2010
15 years 3 months ago
2010
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
143
click to vote
CSCL
2006
15 years 3 months ago
2006
Future CSCL technologies are described by the community as flexible, tailorable, negotiable, and appropriate for various collaborative settings, conditions and contexts. This paper...
118
Voted
CN
2007
15 years 3 months ago
2007
This paper proposes a novel call admission control scheme capable of providing a combination of call and packet level quality of service requirements in cellular packet networks. ...
111
Voted
ML
2008
ACM
15 years 3 months ago
2008
ACM
Call-by-value languages commonly restrict recursive definitions by only allowing functions and syntactically explicit values in the right-hand sides. As a consequence, some very a...