Sciweavers

1927 search results - page 360 / 386
» UMDAs for dynamic optimization problems
Sort
View
129
Voted
CCGRID
2009
IEEE
15 years 1 months ago
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
Han Zhao, Xiaolin Li
ICASSP
2010
IEEE
15 years 20 days ago
Consensus in correlated random topologies: Weights for finite time horizon
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
Dusan Jakovetic, João Xavier, José M...
COR
2010
124views more  COR 2010»
15 years 17 days ago
On tandem blocking queues with a common retrial queue
We consider systems of tandem blocking queues having a common retrial queue. The model represents dynamics of short TCP transfers in the Internet. Analytical results are available...
Konstantin Avrachenkov, Uri Yechiali
CVIU
2006
222views more  CVIU 2006»
15 years 15 days ago
Conditional models for contextual human motion recognition
We present algorithms for recognizing human motion in monocular video sequences, based on discriminative Conditional Random Field (CRF) and Maximum Entropy Markov Models (MEMM). E...
Cristian Sminchisescu, Atul Kanaujia, Dimitris N. ...
DKE
2006
126views more  DKE 2006»
15 years 14 days ago
FRACTURE mining: Mining frequently and concurrently mutating structures from historical XML documents
In the past few years, the fast proliferation of available XML documents has stimulated a great deal of interest in discovering hidden and nontrivial knowledge from XML repositori...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...