3678 search results - page 473 / 736 » On the Stable Paths Problem |
129
Voted
ICRA
1998
IEEE
15 years 10 months ago
1998
IEEE
Signi cant advances have been made in the area of macro planning for assembly operations i.e., dividing a product into sub-assemblies, determining the sequence of assembly operati...
137
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
185
click to vote
ICCI
1991
15 years 9 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
132
click to vote
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
In modern VLSI designs, the increasingly severe power problem requests to minimize clock routing wirelength so that both power consumption and power supply noise can be alleviated...
155
click to vote
AAAI
2010
15 years 7 months ago
2010
Policy search is a successful approach to reinforcement learning. However, policy improvements often result in the loss of information. Hence, it has been marred by premature conv...