10890 search results - page 1946 / 2178 » Automatic Complexity Analysis |
188
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
195
click to vote
IWCIA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
148
click to vote
OOPSLA
2009
Springer
16 years 1 months ago
2009
Springer
The high degree of complexity and autonomy of future robotic space missions, such as Mars Science Laboratory (MSL), poses serious challenges in assuring their reliability and ef...
177
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
157
click to vote
SOUPS
2009
ACM
16 years 29 days ago
2009
ACM
Existing technologies for file sharing differ widely in the granularity of control they give users over who can access their data; achieving finer-grained control generally requ...