Sciweavers

5624 search results - page 31 / 1125
» On Conditional Covering Problem
Sort
View
FOSSACS
2009
Springer
15 years 9 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
PRIMA
2009
Springer
15 years 8 months ago
Designing a Two-Sided Matching Protocol under Asymmetric Information
Abstract. We have developed a new two-sided matching protocol including job applicants and employers in the condition that applicants have conditional preferences and well informed...
Masanori Hatanaka, Shigeo Matsubara
ESOP
2008
Springer
15 years 4 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
ICDCS
2007
IEEE
15 years 8 months ago
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduce...
Zhenhui Shen, Srikanta Tirthapura
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 7 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey