Sciweavers

4913 search results - page 676 / 983
» Results and Perspectives of the G
Sort
View
CP
2009
Springer
16 years 7 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
CHI
2009
ACM
16 years 7 months ago
Note to self: examining personal information keeping in a lightweight note-taking tool
This paper describes a longitudinal field experiment in personal note-taking that examines how people capture and use information in short textual notes. Study participants used o...
Max Van Kleek, Michael S. Bernstein, Katrina Panov...
SIGCSE
2009
ACM
212views Education» more  SIGCSE 2009»
16 years 7 months ago
Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science
This paper describes the implementation and evaluation of a program that uses active recruiting and peer-led team learning to try to increase the participation and success of wome...
Susan Horwitz, Susan H. Rodger, Maureen Biggers, D...
COORDINATION
2009
Springer
16 years 7 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
PODC
2009
ACM
16 years 7 months ago
Distributed and parallel algorithms for weighted vertex cover and other covering problems
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
Christos Koufogiannakis, Neal E. Young