310 search results - page 49 / 62 » dam 2008 |
104
click to vote
DAM
2008
15 years 13 days ago
2008
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
INFORMATICALT
2008
15 years 11 days ago
2008
The paper describes the development of the efficient interface sharpening procedure for viscous incompressible flows governed by the Navier
100
click to vote
DAM
2008
15 years 13 days ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
88
Voted
DAM
2008
15 years 13 days ago
2008
Abstract. In many clustering systems (hierarchies, pyramids and more generally weak hierarchies) clusters are generated by two elements only. This paper is devoted to such clusteri...
DAM
2008
15 years 13 days ago
2008
A vertex-cut X is said to be a restricted cut of a graph G if it is a vertex-cut such that no vertex u in G has all its neighbors in X. Clearly, each connected component of G - X ...