1291 search results - page 171 / 259 » Computing the multiplicity structure in solving polynomial s... |
130
Voted
AGENTS
2001
Springer
15 years 6 months ago
2001
Springer
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
113
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
Distributing scarce resources among agents in a way that maximizes the social welfare of the group is a computationally hard problem when the value of a resource bundle is not lin...
127
click to vote
JAIR
2006
15 years 1 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
105
click to vote
FTDCS
2003
IEEE
15 years 7 months ago
2003
IEEE
Increasingly, Internet-level distributed systems are oriented as much toward information access as they are toward computation. From computer-supported collaborative work to peer-...
104
click to vote
CC
2007
Springer
15 years 1 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...