Sciweavers

3678 search results - page 593 / 736
» On the Stable Paths Problem
Sort
View
ADHOC
2005
122views more  ADHOC 2005»
15 years 3 months ago
Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks
This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we pr...
Hai Liu, Xiaohua Jia, Deying Li, Chan-Hee Lee
152
Voted
TCSV
2008
150views more  TCSV 2008»
15 years 3 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
COMCOM
2004
117views more  COMCOM 2004»
15 years 3 months ago
The case for interdomain dynamic QoS-based service negotiation in the internet
The evolution of the Internet towards a global infrastructure for real time voice and video applications involves providing stringent Quality of Service (QoS) levels. Although som...
Carlos Alberto Kamienski, Djamel Sadok
COMCOM
2007
123views more  COMCOM 2007»
15 years 3 months ago
Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
Ashwin Gumaste, Paparao Palacharla
FUIN
2000
68views more  FUIN 2000»
15 years 3 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester