2957 search results - page 128 / 592 » The Complexity of Polynomial-Time Approximation |
EOR
2007
15 years 3 months ago
2007
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
114
Voted
TCS
2008
15 years 3 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
148
click to vote
TVCG
2008
15 years 3 months ago
2008
Two methods have been used extensively to model resting contact for rigid body simulation. The first approach, the penalty method, applies virtual springs to surfaces in contact to...
138
click to vote
CAL
2002
15 years 3 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
133
Voted
JC
2000
15 years 3 months ago
2000
This paper provides verification procedures for a number of decision problems in quadratic function fields of odd characteristic, thereby establishing membership of these problems...