13603 search results - page 2361 / 2721 » On the Complexity of Computing Treelength |
186
click to vote
VISSYM
2007
15 years 9 months ago
2007
We present a fast hardware-accelerated stippling method which does not require any preprocessing for placing points on surfaces. The surfaces are automatically parameterized in or...
174
Voted
AIPS
2010
15 years 9 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
206
Voted
AAAI
2007
15 years 9 months ago
2007
Complex networks exist in a wide array of diverse domains, ranging from biology, sociology, and computer science. These real-world networks, while disparate in nature, often compr...
176
Voted
AAAI
2007
15 years 9 months ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
167
Voted
AAAI
2007
15 years 9 months ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...