Sciweavers

13271 search results - page 2455 / 2655
» Computers, Programming, and People
Sort
View
KBSE
2010
IEEE
15 years 5 months ago
How did you specify your test suite
Although testing is central to debugging and software certification, there is no adequate language to specify test suites over source code. Such a language should be simple and c...
Andreas Holzer, Christian Schallhart, Michael Taut...
MP
2010
145views more  MP 2010»
15 years 5 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...
MP
2010
94views more  MP 2010»
15 years 5 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
PC
2010
177views Management» more  PC 2010»
15 years 5 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
PSD
2010
Springer
109views Database» more  PSD 2010»
15 years 5 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González
« Prev « First page 2455 / 2655 Last » Next »