Sciweavers

14158 search results - page 189 / 2832
» Generalized switch-setting problems
Sort
View
114
Voted
KR
2010
Springer
15 years 8 months ago
A Correctness Result for Reasoning about One-Dimensional Planning Problems
A plan with rich control structures like branches and loops can usually serve as a general solution that solves multiple planning instances in a domain. However, the correctness o...
Yuxiao Hu, Hector J. Levesque
141
Voted
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
15 years 4 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
CORR
2007
Springer
149views Education» more  CORR 2007»
15 years 3 months ago
About the domino problem in the hyperbolic plane, a new solution
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...
Maurice Margenstern
CISS
2008
IEEE
15 years 10 months ago
Partial side information problem: Equivalence of two inner bounds
— Consider the two-terminal partial side information problem, where one source is decoded under a distortion measure, while the other acts as a helper. There are two well known i...
Soumya Jana, Richard E. Blahut
IPMU
2010
Springer
15 years 5 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...