Sciweavers

10271 search results - page 1842 / 2055
» Self-plagiarism in computer science
Sort
View
MFCS
2007
Springer
16 years 20 days ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
MFCS
2007
Springer
16 years 20 days ago
Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
Spyros C. Kontogiannis, Paul G. Spirakis
MFCS
2007
Springer
16 years 20 days ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
WAIM
2007
Springer
16 years 19 days ago
A New DBMS Architecture for DB-IR Integration
Nowadays, as there is an increasing need to integrate the DBMS (for structured data) with Information Retrieval (IR) features (for unstructured data), DB-IR integration becomes one...
Kyu-Young Whang
WLP
2007
Springer
16 years 19 days ago
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Answer-set programming (ASP) is an emerging logic-programming paradigm that strictly separates the description of a problem from its solving methods. Despite its semantic elegance,...
Martin Gebser, Jörg Pührer, Torsten Scha...
« Prev « First page 1842 / 2055 Last » Next »