8413 search results - page 300 / 1683 » Ordering Problem Subgoals |
163
click to vote
ASPDAC
1999
ACM
15 years 11 months ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
172
click to vote
ENGL
2007
15 years 6 months ago
2007
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
161
click to vote
CN
1998
15 years 6 months ago
1998
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
143
click to vote
SIAMSC
2010
15 years 4 months ago
2010
This paper constructs extrapolated implicit-explicit time stepping methods that allow one to efficiently solve problems with both stiff and nonstiff components. The proposed meth...
186
click to vote
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...