Sciweavers

9842 search results - page 217 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
AIPS
2003
14 years 4 days ago
SOFIA's Choice: Scheduling Observations for an Airborne Observatory
We describe the problem of scheduling observations for an airborne astronomical observatory. The problem incorporates complex constraints relating the feasibility of an astronomic...
Jeremy Frank, Elif Kürklü
MP
2006
134views more  MP 2006»
13 years 10 months ago
Cubic regularization of Newton method and its global performance
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
Yurii Nesterov, Boris T. Polyak
SWAT
1998
Springer
84views Algorithms» more  SWAT 1998»
14 years 3 months ago
Models and Motion Planning
We study the complexity of the motion planning problem for a bounded-reach robot in the situation where the n obstacles in its workspace satisfy two of the realistic models propos...
Mark de Berg, Matthew J. Katz, Mark H. Overmars, A...
IAT
2005
IEEE
14 years 4 months ago
Coordinating Non Cooperative Planning Agents: Complexity Results
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
Adriaan ter Mors, Cees Witteveen
CADE
2009
Springer
14 years 5 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer