2498 search results - page 321 / 500 » Data Structures with Unpredictable Timing |
182
Voted
JSAC
2006
15 years 6 months ago
2006
Abstract--Packet matching plays a critical role in the performance of many network devices and a tremendous amount of research has already been invested to come up with better opti...
224
Voted
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
165
click to vote
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
330
click to vote
CGF
2011
15 years 29 days ago
2011
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
175
Voted
ICA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...