631 search results - page 28 / 127 » Additive Approximation for Edge-Deletion Problems |
ICTAI
2006
IEEE
14 years 4 months ago
2006
IEEE
In order for an autonomous agent to behave robustly in a variety of environments, it must have the ability to learn approximations to many different functions. The function approx...
CPM
2009
Springer
14 years 4 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
MFCS
2007
Springer
14 years 4 months ago
2007
Springer
Consider a rooted directed acyclic graph G = (V, E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the pr...
ECAI
2010
Springer
13 years 7 months ago
2010
Springer
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
ATAL
2007
Springer
14 years 4 months ago
2007
Springer
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...