29908 search results - page 461 / 5982 » On the Complexity of |
183
click to vote
COCO
2005
Springer
16 years 18 days ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
208
click to vote
LACL
2005
Springer
16 years 16 days ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
214
click to vote
WAOA
2005
Springer
16 years 16 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
181
click to vote
ICRA
2003
IEEE
16 years 10 days ago
2003
IEEE
— This paper presents a general approach to specify and execute complex robot tasks considering uncertain environments. Robot tasks are defined by a precise definition of socal...
207
click to vote
ACMICEC
2003
ACM
16 years 9 days ago
2003
ACM
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...