9842 search results - page 262 / 1969 » Problem complexity |
182
click to vote
DSS
2007
15 years 6 months ago
2007
This paper describes a service-based P2P overlay network architecture to support a collaborative environment for solving complex business processes over the network. In the propos...
144
click to vote
TNN
1998
15 years 6 months ago
1998
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...
172
click to vote
IPL
2010
15 years 5 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
208
click to vote
WSNA
2003
ACM
15 years 12 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
185
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...