Sciweavers

1132 search results - page 104 / 227
» Structural Average Case Complexity
Sort
View
ICSM
2007
IEEE
14 years 3 months ago
Package Surface Blueprints: Visually Supporting the Understanding of Package Relationships
Large object-oriented applications are structured over large number of packages. Packages are important but complex structural entities that may be difficult to understand since ...
Stéphane Ducasse, Damien Pollet, Mathieu Su...
SBMF
2009
Springer
105views Formal Methods» more  SBMF 2009»
14 years 3 months ago
Verifying Compiled File System Code
Abstract. This paper presents a case study on retrospective verication of the Linux Virtual File System (VFS), which is aimed at checking for violations of API usage rules and mem...
Jan Tobias Mühlberg, Gerald Lüttgen
CSC
2008
13 years 10 months ago
Efficient and Effective Practical Algorithms for the Set-Covering Problem
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
Qi Yang, Jamie McPeek, Adam Nofsinger
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 4 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
BMCBI
2008
106views more  BMCBI 2008»
13 years 9 months ago
Identification of hot-spot residues in protein-protein interactions by computational docking
Background: The study of protein-protein interactions is becoming increasingly important for biotechnological and therapeutic reasons. We can define two major areas therein: the s...
Solène Grosdidier, Juan Fernández-Re...