Sciweavers

12950 search results - page 264 / 2590
» On Optimal Timed Strategies
Sort
View
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
15 years 5 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
ICMCS
1997
IEEE
131views Multimedia» more  ICMCS 1997»
15 years 11 months ago
A Novel Video Layout Strategy for Near-Video-on-Demand Servers
Near-Video-on-Demand (NVOD) provides customers with a service model completely different from true Video-on-Demand (VOD). In the NVOD service model, customers’ requests are not ...
Shenze Chen, Manu Thapar
ATAL
2006
Springer
15 years 10 months ago
Model checking knowledge, strategies, and games in multi-agent systems
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
Alessio Lomuscio, Franco Raimondi
CCECE
2006
IEEE
16 years 22 days ago
Group-Optimal Linear Space-Time Multiuser Detection
Multiuser detection (MUD) techniques are known to improve the performance of CDMA cellular communication systems. This performance improvement usually comes at a large computation...
Benoit Pelletier, Benoît Champagne
IEEECIT
2006
IEEE
16 years 21 days ago
Real-Time R-D Optimized Frame-Skipping Transcoder for Low Bit Rate Video Transmission
For the low bit rate (LBR) video communications, LBR transcoding is performed by the transcoder to match the network bandwidth and the performance of the client. One of typical tr...
Goo-Rak Kwon, Sang-Hee Park, Jae-Won Kim, Sung-Jea...