Sciweavers

575 search results - page 109 / 115
» Model Checking Restricted Sets of Timed Paths
Sort
View
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
PAMI
2008
275views more  PAMI 2008»
13 years 7 months ago
Coupled Object Detection and Tracking from Static Cameras and Moving Vehicles
Abstract-- We present a novel approach for multi-object tracking which considers object detection and spacetime trajectory estimation as a coupled optimization problem. Our approac...
Bastian Leibe, Konrad Schindler, Nico Cornelis, Lu...
ICAC
2009
IEEE
14 years 2 months ago
Ranking the importance of alerts for problem determination in large computer systems
The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system...
Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhil...
CEC
2007
IEEE
14 years 1 months ago
Target shape design optimization by evolving splines
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...
Pan Zhang, Xin Yao, Lei Jia, Bernhard Sendhoff, Th...
CP
2004
Springer
14 years 24 days ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...