1963 search results - page 236 / 393 » The Maximum Solution Problem on Graphs |
135
click to vote
STOC
2009
ACM
16 years 1 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
122
Voted
AI
2010
Springer
15 years 27 days ago
2010
Springer
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning p...
112
Voted
SCHEDULING
2008
15 years 7 days ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...
129
click to vote
POPL
1997
ACM
15 years 5 months ago
1997
ACM
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
109
Voted
ATS
2005
IEEE
15 years 6 months ago
2005
IEEE
Power reduction during test application is important from the viewpoint of chip reliability and for obtaining correct test results. One of the ways to reduce scan test power is to...