1568 search results - page 99 / 314 » The problem of examination questions in algorithmics |
148
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
145
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
162
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
145
click to vote
CG
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
150
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
To address the problem of unsupervised outlier detection in wireless sensor networks, we develop an algorithm that (1) is flexible with respect to the outlier definition, (2) wo...