Sciweavers

1424 search results - page 115 / 285
» The Multi-radius Cover Problem
Sort
View
ENTCS
2007
115views more  ENTCS 2007»
15 years 6 months ago
A Global Algorithm for Model-Based Test Suite Generation
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
Anders Hessel, Paul Pettersson
SIGCSE
2008
ACM
160views Education» more  SIGCSE 2008»
15 years 6 months ago
CS 0.5: a better approach to introductory computer science for majors
There are often problems when students enter a course with widely different experience levels with key course topics. If the material is covered too slowly, those with greater exp...
Robert H. Sloan, Patrick Troy
NETWORKS
2007
15 years 5 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 4 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
13 years 8 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala