Sciweavers

4674 search results - page 220 / 935
» cases 2008
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Solving Necklace Constraint Problems
Abstract. Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to ...
Pierre Flener, Justin Pearson
EUROPAR
2008
Springer
15 years 8 months ago
Scheduling Intersection Queries in Term Partitioned Inverted Files
Abstract. This paper proposes and presents a comparison of scheduling algorithms applied to the context of load balancing the query traffic on distributed inverted files. We put em...
Mauricio Marín, Carlos Gomez-Pantoja, Senen...
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
15 years 8 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
AAAI
2008
15 years 7 months ago
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...
Fangzhen Lin, Pingzhong Tang
COMGEO
2008
ACM
15 years 6 months ago
Augmenting the connectivity of geometric graphs
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
Manuel Abellanas, Alfredo García Olaverri, ...