420 search results - page 15 / 84 » Some Algorithmic Problems in Polytope Theory |
PODC
1999
ACM
15 years 2 months ago
1999
ACM
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
CADE
1999
Springer
15 years 1 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...
104
Voted
EC
1998
14 years 9 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
120
click to vote
SIGECOM
2011
ACM
14 years 14 days ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
113
click to vote
FLAIRS
2006
14 years 11 months ago
2006
The process of coalition formation, where distinct autonomous agents come together to act as a coherent group is an important form of interaction in multiagent systems. Previous w...