1568 search results - page 239 / 314 » The problem of examination questions in algorithmics |
147
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
140
click to vote
CLUSTER
2007
IEEE
15 years 10 months ago
2007
IEEE
— A critical problem facing by managing large-scale clusters is to identify the location of problems in a system in case of unusual events. As the scale of high performance compu...
135
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Recent statistical performance surveys of search algorithms in difficult combinatorial problems have demonstrated the benefits of randomising and restarting the search procedure. ...
153
click to vote
ML
2002
ACM
15 years 3 months ago
2002
ACM
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
139
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the cl...