3136 search results - page 132 / 628 » Comparison of Clique-Listing Algorithms |
164
click to vote
IROS
2007
IEEE
16 years 19 days ago
2007
IEEE
— A central challenging problem in humanoid robotics is to plan and execute dynamic tasks in dynamic environments. Given that the environment is known, sampling-based online moti...
173
click to vote
ICNP
2006
IEEE
16 years 11 days ago
2006
IEEE
— The rising popularity of live IPTV has triggered renewed interest in P2P multicast. In particular, the simple and robust ‘swarming’ style of P2P multicast is currently favo...
164
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
151
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
140
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...