1795 search results - page 218 / 359 » Search by strategy |
189
Voted
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
OPL is a modeling language for mathematical programming and combinatorial optimization problems. It is the rst modeling language to combine high-level algebraic and set notations f...
140
click to vote
KGC
1993
Springer
15 years 10 months ago
1993
Springer
We provide a logical speci cation of set predicates ndall and bagof of Prolog. The speci cation is given in proof theoretic terms, and pertains to any SLD resolution based language...
155
click to vote
CEC
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
151
click to vote
CGI
2004
IEEE
15 years 10 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
187
click to vote
VLDB
1995
ACM
15 years 10 months ago
1995
ACM
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...