Sciweavers

569 search results - page 104 / 114
» An Efficient Algorithm for Solving Dynamic Complex DCOP Prob...
Sort
View
CVPR
2004
IEEE
14 years 9 months ago
Collaborative Tracking of Multiple Targets
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...
Ting Yu, Ying Wu
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 10 days ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
ATAL
2008
Springer
13 years 9 months ago
Multi-agent plan diagnosis and negotiated repair
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
Huib Aldewereld, Pieter Buzing, Geert Jonker
WWW
2007
ACM
14 years 8 months ago
Compare&contrast: using the web to discover comparable cases for news stories
Comparing and contrasting is an important strategy people employ to understand new situations and create solutions for new problems. Similar events can provide hints for problem s...
Jiahui Liu, Earl Wagner, Larry Birnbaum
TC
2008
13 years 7 months ago
Exploiting In-Memory and On-Disk Redundancy to Conserve Energy in Storage Systems
Abstract--Today's storage systems place an imperative demand on energy efficiency. A storage system often places single-rotationrate disks into standby mode by stopping them f...
Jun Wang, Xiaoyu Yao, Huijun Zhu