Sciweavers

11455 search results - page 1857 / 2291
» The Rayset and Its Applications
Sort
View
COR
2008
95views more  COR 2008»
15 years 7 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 7 months ago
The System Kato: Detecting Cases of Plagiarism for Answer-Set Programs
Plagiarism detection is a growing need among educational institutions and solutions for different purposes exist. An important field in this direction is detecting cases of source...
Johannes Oetsch, Jörg Pührer, Martin Sch...
CORR
2008
Springer
107views Education» more  CORR 2008»
15 years 7 months ago
A Computational Framework for the Near Elimination of Spreadsheet Risk
We present Risk Integrated's Enterprise Spreadsheet Platform (ESP), a technical approach to the near-elimination of spreadsheet risk in the enterprise computing environment, ...
Yusuf Jafry, Fredrika Sidoroff, Roger Chi
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 7 months ago
On the size of identifying codes in triangle-free graphs
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
Florent Foucaud, Ralf Klasing, Adrian Kosowski, An...
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 7 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
« Prev « First page 1857 / 2291 Last » Next »