2542 search results - page 157 / 509 » Computing Cartograms with Optimal Complexity |
117
click to vote
FPL
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we develop a unified theory in analyzing optimal switch box design problems, particularly for the unsolved irregular cases, where different pin counts are allowed on...
126
click to vote
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
POMDPs and their decentralized multiagent counterparts, DEC-POMDPs, offer a rich framework for sequential decision making under uncertainty. Their computational complexity, howeve...
126
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— The goal of this paper is to develop modeling techniques for complex systems for the purposes of control, estimation, and inference: (i) A new class of Hidden Markov Models is ...
140
click to vote
ASPDAC
2005
ACM
15 years 5 months ago
2005
ACM
— Architecture Description Languages (ADLs) are widely used to perform design space exploration for Application Specific Instruction Set Processors (ASIPs). While the design spa...
121
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...