2192 search results - page 39 / 439 » Algorithms for Challenging Motif Problems |
123
Voted
AIPS
2009
15 years 3 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
132
Voted
INFOSCALE
2007
ACM
15 years 4 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
125
Voted
ICPP
2000
IEEE
15 years 6 months ago
2000
IEEE
The idle computers on a local area, campus area, or even wide area network represent a significant computational resource--one that is, however, also unreliable, heterogeneous, an...
118
Voted
ISMIS
2009
Springer
15 years 9 months ago
2009
Springer
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
124
Voted
NIPS
2008
15 years 4 months ago
2008
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...