The following pages link to (Q3619797):
Displaying 50 items.
- Performance analysis of statistical optimal data fusion algorithms (Q506153) (← links)
- Designing optimal- and fast-on-average pattern matching algorithms (Q511153) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- Efficient methods for grouping vectors into low-rank clusters (Q550984) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Parametric search made practical (Q598230) (← links)
- Adaptive meshing in a mixed regime hydrologic simulation model (Q601238) (← links)
- Finding monotone paths in edge-ordered graphs (Q602679) (← links)
- New perspectives in VLSI design automation: deterministic packing by sequence pair (Q610960) (← links)
- Local MST computation with short advice (Q613116) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- The simplified partial digest problem: approximation and a graph-theoretic model (Q621677) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Reconcilable differences (Q639856) (← links)
- Integer merging on EREW PRAM (Q644851) (← links)
- On aggregation of normed structures (Q646150) (← links)
- Efficiency issues in the KBMAG procedure (Q649584) (← links)
- On the source switching problem of peer-to-peer streaming (Q666117) (← links)
- On cluster resource allocation for multiple parallel task graphs (Q666258) (← links)
- Amortized complexity verified (Q670702) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Matching nuts and bolts faster (Q671403) (← links)
- A fundamental restriction on fully dynamic maintenance of bin packing (Q671611) (← links)
- Precise interprocedural dataflow analysis with applications to constant propagation (Q671681) (← links)
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere (Q672249) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- Parallel algorithms for priority queue operations (Q672391) (← links)
- Multiple matching of parameterized patterns (Q672748) (← links)
- Efficient management of multiple outstanding timeouts (Q673605) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- New algorithms for mimizing the longest wire length during circuit compaction. (Q676272) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- An upper bound for conforming Delaunay triangulations (Q685182) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Asymptotic behavior of eigenvalues and random updating schemes (Q688863) (← links)
- Visibility drawings of plane 3-trees with minimum area (Q691641) (← links)
- The Baire partial quasi-metric space: a mathematical tool for asymptotic complexity analysis in computer science (Q692921) (← links)
- Maximizing sharing of protected information (Q696957) (← links)
- Computability in linear algebra (Q703545) (← links)
- A simple tabu search for warehouse location (Q703910) (← links)
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms (Q709151) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- A discrete-continuous routing problem with precedence constraints (Q721512) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Pursuit and synchronization in hydrodynamic dipoles (Q745971) (← links)
- Selectors make set-based analysis too hard (Q812081) (← links)
