5084 search results - page 101 / 1017 » Proving Possibility Properties |
154
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
160
Voted
WCC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
142
click to vote
DEXA
2004
Springer
15 years 10 months ago
2004
Springer
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
151
click to vote
CSFW
2003
IEEE
15 years 10 months ago
2003
IEEE
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
135
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...