365 search results - page 6 / 73 » Local Computation Schemes with Partially Ordered Preferences |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
The problem of expressing and solving satisfiability problems (SAT) with qualitative preferences is central in many areas of Computer Science and Artificial Intelligence. In previo...
TCS
2008
13 years 7 months ago
2008
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
ISMB
1994
13 years 8 months ago
1994
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...
ICNP
2002
IEEE
14 years 9 days ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider manipulation problems when the manipulator only has partial information about the votes of the nonmanipulators. Such partial information is described by an information...