1382 search results - page 29 / 277 » Term ordering problem on MDG |
SIAMNUM
2010
13 years 5 months ago
2010
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
FCT
2001
Springer
14 years 3 months ago
2001
Springer
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
ESSLLI
2009
Springer
13 years 8 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
CIKM
2011
Springer
12 years 11 months ago
2011
Springer
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
GECCO
2000
Springer
14 years 2 months ago
2000
Springer
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been appli...