3894 search results - page 296 / 779 » Approximation Algorithms for Biclustering Problems |
198
click to vote
STACS
2005
Springer
16 years 4 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
188
click to vote
IJCAI
2007
15 years 8 months ago
2007
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
141
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
172
click to vote
CD
2005
Springer
16 years 6 days ago
2005
Springer
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall a...
168
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...