Sciweavers

956 search results - page 175 / 192
» Dimensions in program synthesis
Sort
View
JMLR
2010
155views more  JMLR 2010»
13 years 8 months ago
Approximate Tree Kernels
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
MP
2010
145views more  MP 2010»
13 years 8 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
SIGCSE
2010
ACM
395views Education» more  SIGCSE 2010»
13 years 8 months ago
Linux kernel projects for an undergraduate operating systems course
In this paper, we present a series of programming projects based on the Linux kernel for students in a senior-level undergraduate operating systems course. The projects we describ...
Rob Hess, Paul Paulson
IEEECIT
2010
IEEE
13 years 7 months ago
Learning Autonomic Security Reconfiguration Policies
Abstract--We explore the idea of applying machine learning techniques to automatically infer risk-adaptive policies to reconfigure a network security architecture when the context ...
Juan E. Tapiador, John A. Clark
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 4 months ago
The Impact of Memory Models on Software Reliability in Multiprocessors
The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated ...
Alexander Jaffe, Thomas Moscibroda, Laura Effinger...