Sciweavers

8810 search results - page 1685 / 1762
» Openness
Sort
View
JSW
2008
202views more  JSW 2008»
15 years 3 months ago
Change Prediction in Object-Oriented Software Systems: A Probabilistic Approach
An estimation of change-proneness of parts of a software system is an active topic in the area of software engineering. Such estimates can be used to predict changes to different c...
Ali R. Sharafat, Ladan Tahvildari
DM
2007
97views more  DM 2007»
15 years 3 months ago
L(p, q) labeling of d-dimensional grids
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
Guillaume Fertin, André Raspaud
134
Voted
JGS
2006
113views more  JGS 2006»
15 years 3 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
118
Voted
KER
2008
107views more  KER 2008»
15 years 3 months ago
Tuplespace-based computing for the Semantic Web: a survey of the state-of-the-art
Semantic technologies promise to solve many challenging problems of the present Web applications. As they achieve a feasible level of maturity, they become increasingly accepted i...
Lyndon J. B. Nixon, Elena Paslaru Bontas Simperl, ...
ECCC
2007
122views more  ECCC 2007»
15 years 3 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
« Prev « First page 1685 / 1762 Last » Next »