1433 search results - page 101 / 287 » On Covering Problems of Rado |
202
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
157
click to vote
TSMC
2011
15 years 1 months ago
2011
— Most state-based approaches to fault diagnosis of discrete-event systems require a complete and accurate model of the system to be diagnosed. In this paper, we address the prob...
180
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
174
click to vote
COCOA
2009
Springer
15 years 9 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
171
click to vote
IJCNN
2006
IEEE
16 years 11 days ago
2006
IEEE
Abstract— In previous work, we have shown that both unsupervised feature selection and the semi-supervised clustering problem can be usefully formulated as multiobjective optimiz...