113 search results - page 7 / 23 » Improved Approximation for the Directed Spanner Problem |
89
Voted
CONIELECOMP
2005
IEEE
15 years 5 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
117
click to vote
JCP
2007
14 years 11 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
103
click to vote
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
NIPS
2008
15 years 1 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
104
click to vote
INFOCOM
2003
IEEE
15 years 4 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...