Search results

In [[applied mathematics]], a '''nonlinear complementarity problem (NCP)''' wi ...he case of a discontinuous mapping was discussed by Habetler and Kostreva (1978). ...

...topic is notable separately from [[Klee's measure problem]], which puts it in relevant context. [[User:Felix QW|Felix QW]] ([[User talk:Felix QW|talk]]) Framed as an open research problem published in 1977 in ''The American Mathematical Monthly'',<ref>{{cite journal ...

...by {{harvtxt|Frederickson|Hecht|Kim|1978}}, with an equivalent formulation in terms of [[mixed graph]]s with directed edges modeling the input pairs and ...air <math>(p,p)</math> for each point in the travelling salesman instance. In the other direction, the stacker crane problem can be viewed as a special c ...

...Willard for the 2008 University at Albany President’s Award for Excellence in Research. ...e worked at [[Bell Labs]] for four years before joining the Albany faculty in 1983.<ref name="cv">[http://www.cs.albany.edu/~dew/outside.pdf Curriculum v ...

...s]] of the graph that has a nonempty intersection with every [[odd cycle]] in the graph. Removing the vertices of an odd cycle transversal from a graph l ...versal can be bipartitioned according to which copy of the vertex was used in the cover.{{r|pa}} ...

...for [[numerical integration]]. It is a variant of [[Gaussian quadrature]], in which the evaluation points are chosen so that an accurate approximation ca These formulas are named after [[Alexander Kronrod]], who invented them in the 1960s, and [[Carl Friedrich Gauss]]. ...

...istance spanning tree''', or '''minimum average distance spanning tree'''. In an unweighted graph, this is the spanning tree of minimum [[Wiener index]]. ...cost spanning tree of an unweighted [[interval graph]] can be constructed in linear time.{{r|ddr}} A polynomial time algorithm is also known for [[dista ...

...eral distribution]] and there are ''k'' servers. The model name is written in [[Kendall's notation]], and is an extension of the [[M/M/c queue]], where s ...e set {0,1,2,3...}, where the value corresponds to the number of customers in the queue, including any being served. Transitions from state ''i'' to ''i' ...

{{Short description|Computing using random bit streams}} ...then be computed by simple bit-wise operations on the streams. Stochastic computing is distinct from the study of [[randomized algorithm]]s. ...

...tson University]] in 1962,{{r|green}} and completed a Ph.D. in mathematics in 1969 at [[Arizona State University]]. Her dissertation, ''Some Results on < ...ormation science.{{r|green}} She came to the University of Hawaiʻi at Hilo in 1990,{{r|regents}} and chaired the computer science department there for ma ...

...= Using the Borsuk–Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry ...thematician)|Jiří Matoušek]], and published in 2003 by [[Springer-Verlag]] in their Universitext series ({{ISBN|978-3-540-00362-5}}).{{r|dzedzej|popliche ...

...g|cover]] all edges in ''E''. A collection of bicliques covering all edges in ''G'' is called a '''biclique edge cover''', or sometimes '''biclique cover An example for a biclique edge cover is given in the following diagrams: ...

{{Short description|Solution in cooperative games}} ...he [[leximin order]]. The nucleolus was introduced by [[David Schmeidler]] in 1969.<ref name="schmeidler">{{Citation |last=Schmeidler |first=D. |title=Th ...

...humb|360px|A 2-vertex-connected graph, its square, and a Hamiltonian cycle in the square]] ...ltonian. It is named after [[Herbert Fleischner]], who published its proof in 1974. ...

'''Rolf Rannacher''' (born 10 June 1948 in [[Leipzig]]) is a German mathematician and a professor of [[numerical analy ...1988 a professor at [[Saarland University]]. Since 1988 he is a professor in Heidelberg. ...

...P-complete]] variant of the [[Boolean satisfiability problem]], often used in proofs of NP-completeness.{{r|moqo}} ...ires that the three values in each clause are not all equal to each other (in other words, at least one is true, and at least one is false).{{r|noc}} ...

...[butterfly network]], a multitree used in distributed computation, showing in red the undirected tree induced by the subgraph reachable from one of its v ...d path between any two [[Vertex (graph theory)|vertices]], or equivalently in which the [[Glossary of graph theory#subgraph|subgraph]] reachable from any ...

In [[order theory|order-theoretic]] mathematics, a '''series-parallel partial | series = Lecture Notes in Computer Science ...

...asking a question such as: What is the expected number of bins with a ball in them?<ref>{{Cite web |last=Oliveira |first=Rafael |date=May 20, 2021 |title ...the lesser-loaded bin. This paradigm has found wide practical applications in shared-memory emulations, efficient hashing schemes, randomized load balanc ...

{{AFC comment|1=From both his publication record and being an editor in chief he passes [[WP:NPROF]]; I do not agree with the prior statements. How Jim Pitman (James W. Pitman) was born in Hobart, Australia, in June 1949, ...