Sciweavers

1719 search results - page 230 / 344
» Scheduling with soft constraints
Sort
View
ICML
2010
IEEE
13 years 10 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
EOR
2010
119views more  EOR 2010»
13 years 9 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
TLT
2008
93views more  TLT 2008»
13 years 8 months ago
What Do You Prefer? Using Preferences to Enhance Learning Technology
While the growing number of learning resources increases the choice for learners on how, what and when to learn, it also makes it more and more difficult to find the learning resou...
Philipp Kärger, Daniel Olmedilla, Fabian Abel...
CLOUDCOM
2010
Springer
13 years 7 months ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...
TSP
2010
13 years 3 months ago
MIMO cognitive radio: a game theoretical approach
Abstract--The concept of cognitive radio (CR) has recently received great attention from the research community as a promising paradigm to achieve efficient use of the frequency re...
Gesualdo Scutari, Daniel Pérez Palomar