815 search results - page 3 / 163 » Where are the hard manipulation problems |
CLIMA
2008
13 years 6 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
ICCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...