Sciweavers

837 search results - page 81 / 168
» Hard combinators
Sort
View
CORR
2008
Springer
77views Education» more  CORR 2008»
14 years 12 months ago
Energy-efficient Scheduling of Delay Constrained Traffic over Fading Channels
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...
Juyul Lee, Nihar Jindal
EOR
2010
119views more  EOR 2010»
14 years 12 months ago
Adaptive Tabu Search for course timetabling
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...
Zhipeng Lü, Jin-Kao Hao
CSCL
2006
109views more  CSCL 2006»
14 years 12 months ago
Supporting synchronous collaborative learning: A generic, multi-dimensional model
Future CSCL technologies are described by the community as flexible, tailorable, negotiable, and appropriate for various collaborative settings, conditions and contexts. This paper...
Jacques Lonchamp
CN
2007
116views more  CN 2007»
14 years 12 months ago
Joint call and packet QoS in cellular packet networks
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. ...
Majid Ghaderi, Raouf Boutaba, Gary W. Kenward
ML
2008
ACM
14 years 12 months ago
Unrestricted pure call-by-value recursion
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...
Johan Nordlander, Magnus Carlsson, Andy Gill