868 search results - page 171 / 174 » Finding Most Likely Solutions |
SIROCCO
2010
13 years 9 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
FLAIRS
2004
13 years 9 months ago
2004
Open source intelligence analysts routinely use the web as a source of information related to their specific taskings. Effective information gathering on the web, despite the prog...
IJCAI
2001
13 years 9 months ago
2001
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
NIPS
1998
13 years 9 months ago
1998
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...