4865 search results - page 779 / 973 » The Complexity of Graph Connectivity |
132
click to vote
CIAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
116
click to vote
DIS
2003
Springer
15 years 9 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
143
click to vote
GMP
2002
IEEE
15 years 9 months ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
115
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
130
click to vote
ECOOP
1999
Springer
15 years 8 months ago
1999
Springer
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...