Sciweavers

720 search results - page 103 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
LFCS
2007
Springer
16 years 5 days ago
Model Checking Knowledge and Linear Time: PSPACE Cases
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
Kai Engelhardt, Peter Gammie, Ron van der Meyden
CN
2008
109views more  CN 2008»
15 years 6 months ago
CoCONet: A collision-free container-based core optical network
Electrical-to-optical domain conversions and vice versa (denoted by O/E/O conversions) for each hop in optical core transport networks impose considerable capital and financial ov...
Amin R. Mazloom, Preetam Ghosh, Kalyan Basu, Sajal...
FGCS
2007
160views more  FGCS 2007»
15 years 6 months ago
Distributed data mining in grid computing environments
The computing-intensive data mining for inherently Internet-wide distributed data, referred to as Distributed Data Mining (DDM), calls for the support of a powerful Grid with an e...
Ping Luo, Kevin Lü, Zhongzhi Shi, Qing He
STACS
2005
Springer
15 years 11 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
ICIP
2004
IEEE
16 years 7 months ago
Low-complexity rate-distortion optimized video streaming
This paper proposes two techniques for low-complexity rate-distortion (R-D) optimized streaming of packetized video. These techniques enable computing packet transmission schedule...
Jacob Chakareski, John G. Apostolopoulos, Bernd Gi...