Sciweavers

193 search results - page 15 / 39
» Experimenting with pair programming in the classroom
Sort
View
IOR
2006
173views more  IOR 2006»
14 years 11 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
ICML
2007
IEEE
16 years 16 days ago
Fast and effective kernels for relational learning from texts
In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such mode...
Alessandro Moschitti, Fabio Massimo Zanzotto
COMPSAC
2002
IEEE
15 years 4 months ago
Process Support and Knowledge Management for Virtual Teams Doing Agile Software Development
Agile practices are arguably improving the productivity of small, co-located software development teams. In this paper, we describe an approach that tries to overcome the constrai...
Seth Bowen, Frank Maurer
POPL
2007
ACM
16 years 1 days ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ICDE
2012
IEEE
205views Database» more  ICDE 2012»
13 years 2 months ago
Optimizing Statistical Information Extraction Programs over Evolving Text
—Statistical information extraction (IE) programs are increasingly used to build real-world IE systems such as Alibaba, CiteSeer, Kylin, and YAGO. Current statistical IE approach...
Fei Chen, Xixuan Feng, Christopher Re, Min Wang