The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection (Q905751) (← links)
- Adaptive continuous higher order sliding mode control (Q905799) (← links)
- Extended RDF: computability and complexity issues (Q905991) (← links)
- Integrated data depth for smooth functions and its application in supervised classification (Q906141) (← links)
- A calculus and logic of bunched resources and processes (Q906271) (← links)
- Cost analysis for a supplier in an inflationary environment with stock dependent demand rate for perishable items (Q906281) (← links)
- Implementing second-order decision analysis: concepts, algorithms, and tool (Q906286) (← links)
- Scheduling mixed-model production on multiple assembly lines with shared resources using genetic algorithms: the case study of a motorbike company (Q906292) (← links)
- No violation of the Leibniz rule. No fractional derivative (Q907149) (← links)
- Rényi entropies, \(L_q\) norms and linearization of powers of hypergeometric orthogonal polynomials by means of multivariate special functions (Q907511) (← links)
- Parameter switching in a generalized Duffing system: finding the stable attractors (Q907521) (← links)
- Functional data analysis as a tool to correlate textural and geochemical data (Q907571) (← links)
- A parallel fast boundary element method using cyclic graph decompositions (Q907583) (← links)
- Presentation of a highly tuned multithreaded interval solver for underdetermined and well-determined nonlinear systems (Q907591) (← links)
- Early-warning signs for pattern-formation in stochastic partial differential equations (Q907597) (← links)
- Circular, elliptic and oval billiards in a gravitational field (Q907642) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- Disjoint difference families and their applications (Q908044) (← links)
- Fundamental issues of artificial intelligence. Proceedings of the 2nd conference on the philosophy and theory of artificial intelligence, PT-AI, Oxford, UK, September 21--22, 2013 (Q908101) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Reasoning about truth (Q908899) (← links)
- Constructing the vertex-transitive graphs of order 24 (Q908938) (← links)
- Quadratic regulatory theory for analytic non-linear systems with additive controls (Q909222) (← links)
- A linear-time algorithm for concave one-dimensional dynamic programming (Q909460) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- A note on a theorem of Blum, Shub, and Smale (Q909656) (← links)
- Denotational semantics of a parallel object-oriented language (Q910250) (← links)
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences (Q911595) (← links)
- On Alspach's conjecture (Q911616) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- On representing Sylvester-Gallai designs (Q912856) (← links)
- Product form in networks of queues with batch arrivals and batch services (Q913384) (← links)
- Deterministic optimal and expedient move-to-rear list organizing strategies (Q914378) (← links)
- The limiting probability that \(\alpha\)-in, \(\beta\)-out is strongly connected (Q914707) (← links)
- Matrix multiplication via arithmetic progressions (Q915378) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Bit-optimal election in synchronous rings (Q916342) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
- Type inference for polymorphic references (Q918190) (← links)
- The cryptanalysis of FEAL-4 with 20 chosen plaintexts (Q918498) (← links)
- Recognizing tough graphs is NP-hard (Q918697) (← links)
- Reasoning with belief functions: An analysis of compatibility (Q918731) (← links)
- X-machines and the halting problem: Building a super-turing machine (Q919823) (← links)
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- On the independence number of random graphs (Q923109) (← links)
- Approximating orders in meet-continuous lattices and regularity axioms in many valued topology (Q925255) (← links)
- Dynamic realization games in newsvendor inventory centralization (Q926190) (← links)
