3894 search results - page 660 / 779 » Approximation Algorithms for Biclustering Problems |
126
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
In several agent-oriented scenarios in the real world, an autonomous agent that is situated in an unknown environment must learn through a process of trial and error to take actio...
131
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
129
Voted
AAAI
2007
15 years 5 months ago
2007
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
146
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
140
click to vote
ATAL
2009
Springer
15 years 10 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 ...