1199 search results - page 189 / 240 » Parameterized Proof Complexity |
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
GMP
2002
IEEE
14 years 1 months ago
2002
IEEE
We present new results on classifying the morphology of the nonsingular intersection curve of two quadrics by studying the roots of the characteristic equation, or the discriminan...
ATAL
2006
Springer
14 years 16 days ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...
NIPS
2003
13 years 10 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
SPRINGSIM
2007
13 years 10 months ago
2007
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...