Sciweavers

1994 search results - page 250 / 399
» Computation of Optical Flow Using Dynamic Programming
Sort
View
IPPS
2000
IEEE
15 years 2 months ago
Applying Interposition Techniques for Performance Analysis of OpenMP Parallel Applications
Tuning parallel applications requires the use of effective tools for detecting performance bottlenecks. Along a parallel program execution, many individual situations of performan...
Marc González, Albert Serra, Xavier Martore...
CLUSTER
2002
IEEE
14 years 9 months ago
Location Selection for Active Services
Active services are application-specified programs that are executed inside the network. The location where the active service is executed plays an important role. The dynamic beha...
Roger Karrer, Thomas R. Gross
CEC
2010
IEEE
14 years 11 months ago
Learning to overtake in TORCS using simple reinforcement learning
In modern racing games programming non-player characters with believable and sophisticated behaviors is getting increasingly challenging. Recently, several works in the literature ...
Daniele Loiacono, Alessandro Prete, Pier Luca Lanz...
ORL
2006
105views more  ORL 2006»
14 years 10 months ago
Inventory placement in acyclic supply chain networks
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
Thomas L. Magnanti, Zuo-Jun Max Shen, Jia Shu, Dav...
NSDI
2008
15 years 9 days ago
Swift: A Fast Dynamic Packet Filter
This paper presents Swift, a packet filter for high performance packet capture on commercial off-the-shelf hardware. The key features of Swift include (1) extremely low filter upd...
Zhenyu Wu, Mengjun Xie, Haining Wang