1414 search results - page 124 / 283 » Cover Time and Broadcast Time |
FASE
2007
Springer
15 years 4 months ago
2007
Springer
We use 63 features extracted from sources such as versioning and issue tracking systems to predict defects in short time frames of two months. Our multivariate approach covers aspe...
WADS
2007
Springer
15 years 4 months ago
2007
Springer
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
101
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
SIGECOM
2000
ACM
15 years 2 months ago
2000
ACM
Using data collected between August 1999 and January 2000, we examine firm-level pricing strategies for 32 online bookstores. The data cover more than 300 books, including New Yor...
ISTCS
1993
Springer
15 years 2 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...