Sciweavers

6437 search results - page 896 / 1288
» Parallel Algorithms for Arrangements
Sort
View
FCT
2007
Springer
15 years 10 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
WSC
2008
15 years 9 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky
AIPR
2008
IEEE
15 years 8 months ago
Low-cost, high-speed computer vision using NVIDIA's CUDA architecture
In this paper, we introduce real time image processing techniques using modern programmable Graphic Processing Units (GPU). GPUs are SIMD (Single Instruction, Multiple Data) device...
Seung In Park, Sean P. Ponce, Jing Huang, Yong Cao...
NETWORKING
2010
15 years 8 months ago
Bidirectional Range Extension for TCAM-Based Packet Classification
Abstract. Packet classification is a fundamental task for network devices such as edge routers, firewalls, and intrusion detection systems. Currently, most vendors use Ternary Cont...
Yan Sun, Min Sik Kim
OPODIS
2004
15 years 8 months ago
Lock-Free and Practical Doubly Linked List-Based Deques Using Single-Word Compare-and-Swap
Abstract. We present an efficient and practical lock-free implementation of a concurrent deque that supports parallelism for disjoint accesses and uses atomic primitives which are ...
Håkan Sundell, Philippas Tsigas