520 search results - page 75 / 104 » New Complexity Results for Classical Planning Benchmarks |
PAKDD
2009
ACM
14 years 3 months ago
2009
ACM
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
Agent theories and agent programs are two very different styles of specification of agent behavior. The former are declarative in nature, while the latter have an imperative fl...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
ICIP
2005
IEEE
14 years 10 months ago
2005
IEEE
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
COLT
2005
Springer
14 years 1 months ago
2005
Springer
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...