728 search results - page 113 / 146 » Compressing combinatorial objects |
AIPS
2006
13 years 11 months ago
2006
Planning as satisfiability (SAT-Plan) is one of the best approaches to optimal planning, which has been shown effective on problems in many different domains. However, the potenti...
NIPS
2001
13 years 11 months ago
2001
If the promise of computational modeling is to be fully realized in higherlevel cognitive domains such as language processing, principled methods must be developed to construct th...
MASCOTS
2003
13 years 11 months ago
2003
The Web proxy cache placement problem is often formulated as a classical optimization problem: place N proxies within an internetwork so as to minimize the average user response t...
AAAI
1998
13 years 11 months ago
1998
Manydesign problems are solved using multiple levels of abstraction, wherea design at one level has combinatorially manychildren at the next level. A stochastic optimization metho...
AC
2008
Springer
13 years 10 months ago
2008
Springer
Sparse matrices are first class objects in many VHLLs (very high level languages) used for scientific computing. They are a basic building block for various numerical and combinat...