Sciweavers

14386 search results - page 309 / 2878
» The Chinese Generals Problem
Sort
View
129
Voted
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 9 months ago
The standard parts problem and the complexity of control communication
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
John Baillieul, Wing Shing Wong
COMPULOG
1999
Springer
15 years 9 months ago
Dynamic Constraint Models for Planning and Scheduling Problems
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...
Roman Barták
ESOP
2009
Springer
15 years 9 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
FOCS
2004
IEEE
15 years 8 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
ECCV
2006
Springer
15 years 8 months ago
Trace Quotient Problems Revisited
The formulation of trace quotient is shared by many computer vision problems; however, it was conventionally approximated by an essentially different formulation of quotient trace,...
Shuicheng Yan, Xiaoou Tang