Sciweavers

2766 search results - page 371 / 554
» Algorithms for trigonometric polynomials
Sort
View
133
Voted
AIPS
2009
15 years 5 months ago
The Influence of k-Dependence on the Complexity of Planning
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
Omer Giménez, Anders Jonsson
ATAL
2010
Springer
15 years 5 months ago
Agents towards vehicle routing problems
A multi-agent VRP solver is presented in this paper. It utilizes the contract-net protocol based allocation and several improvement strategies. It provides the solution with the q...
Jirí Vokrínek, Antonín Komend...
CORR
2010
Springer
64views Education» more  CORR 2010»
15 years 4 months ago
Near-Optimal Evasion of Convex-Inducing Classifiers
Classifiers are often used to detect miscreant activities. We study how an adversary can efficiently query a classifier to elicit information that allows the adversary to evade de...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...
CORR
2010
Springer
106views Education» more  CORR 2010»
15 years 4 months ago
MDPs with Unawareness
Markov decision processes (MDPs) are widely used for modeling decision-making problems in robotics, automated control, and economics. Traditional MDPs assume that the decision mak...
Joseph Y. Halpern, Nan Rong, Ashutosh Saxena
CORR
2008
Springer
158views Education» more  CORR 2008»
15 years 4 months ago
Improved Smoothed Analysis of the k-Means Method
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
Bodo Manthey, Heiko Röglin