The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 713 of Mathematical Reviews Vol. , Issue 2003A
[page]
2003
Mathematical Reviews
Preserved Fulltext
(English summary)
Algorithmica 32 (2002), no. 4, 651-678.
The problem considered is one of scheduling multiprocessor tasks on a set of parallel uniform machines to minimize schedule length. ...
Ser.2 8 (2001), no. 2, 3-16.
Summary (translated from the Russian): “We consider the prob- lem of the best location of production facilities with constrained production volumes. ...
Page 479 of Mathematical Reviews Vol. , Issue 2002A
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Algorithmica 30 (2001), no. 4, 563-596.
Summary: “We discuss a triangulation algorithm that is based on repeatedly clipping ears of a polygon. ...
Based on our im- plementation we report on different strategies (geometric hashing, bounding-volume trees) for speeding up the ear-clipping process in practice. ...
Page 9208 of Mathematical Reviews Vol. , Issue 2004k
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary)
Algorithmica 38 (2004), no. 4, 577-589. ...
Comput. 32 (2003), no. 3, 700-716 (electronic)] introduced a subcubic time algorithm. ...
Page 7470 of Mathematical Reviews Vol. , Issue 2004i
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary)
Algorithmica 37 (2003), no. 4, 243-262.
The authors study the following scheduling problem. ...
Sched. 4 (2001), no. 6, 287-296.
Summary: “We consider a benefit model for on-line preemptive scheduling. In this model jobs arrive at the on-line scheduler at their release time. ...
Deforming generalized cylinders without self-intersection by means of a parametric center curve
2018
Computational Visual Media
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is text/html.
Fleshing: Spine-driven bending with local volume preservation. Computer Graphics Forum Vol. 32, No. 2pt3, 295–304, 2013.CrossRefGoogle Scholar
[37]Angelidis, A.; Singh, K. ...
Kinodynamic skinning using volume-preserving deformations. ...
doi:10.1007/s41095-018-0127-7
fatcat:3bldvhljxbddpl33ww42iktlbe
An annotated bibliography on 1-planarity
2017
Computer Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1703.02261v2 fatcat:rmxs6yoh6jfhzobwpiqlarqryyOther Versions
Drawing Graphs, Methods and Models, volume 2025 of LNCS. Springer, 2001. • [106] T. ...
In GD 2001, volume 2265 of LNCS, pages 312-327. Springer, 2002. • [43] F. R. K. Chung, F. T. Leighton, and A. L. Rosenberg. ...
doi:10.1016/j.cosrev.2017.06.002
fatcat:sjx2s5s4a5awzpsylfoc5upfmi
Hybrid approximation for minimum-cost target coverage in wireless sensor networks
2009
Optimization Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Computer Measurement Group Journal. 122:53-67, 2008.
32. Jie Wang and Ning Zhong. Minimum-cost sensor arrangement for achieving wanted
coverage lifetime. ...
Algorithmica, 23:363-373, 1999.
49. Jie Wang and Yaorong Ge. An optimization problem in virtual endoscopy.
Theoretical Computer Science, 207:203-216, 1998.
50. ...
doi:10.1007/s11590-009-0167-0
fatcat:wimey2e7w5cthmspfrm2h6ye24
Bamboo Garden Trimming Problem: Priority Schedulings
2019
Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
; Springer: Berlin, Germany, 2001, Volume 2076, pp. 862–874.
29. ...
Algorithmica 2012,
63, 26–38. [CrossRef]
7. D’Emidio, M.; Di Stefano, G.; Frigioni, D.; Navarra, A. ...
doi:10.3390/a12040074
fatcat:nbsvwakdybbb7fyng4uhzqphrq
Ant colony system: a cooperative learning approach to the traveling salesman problem
1997
IEEE Transactions on Evolutionary Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
PhD, Faculté des Sciences Appliquées, Université Libre de Bruxelles (2006) 32. Zemel, E.: Measuring the quality of approximate solutions to zero-one programming problems. ...
Algorithmica 1(1), 111-129 (1986) 126. Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Heidelberg (2004) 127. ...
John Wiley and Sons LTD., Chichester (2001) 164. Branke, J.: Evolutionary Optimization in Dynamic Environments, pp. 125-172. Kluwer A. P., Netherlands (2001) 165. ...
doi:10.1109/4235.585892
fatcat:mo4wg7gnhzaofi4yknobao6ddy
Page 135 of Mathematical Reviews Vol. , Issue Author Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) Algorithmica 32 (2002), no. 1, 157-162. (Summary) 2002h:68071 68Q25 (65F30, 68W40)
Baxa, Christoph Some remarks on the discrepancy of the sequence (a /n). ...
(Sivan) 35 (2001), no. 1, 32-35. 54H25
Bax, E. (with Franklin, Joel N.) A permanent algorithm with exp[Q(n'/3 /2 Inn)] expected speedup for 0-1 matrices. ...
Page 1782 of Mathematical Reviews Vol. , Issue Author Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) Algorithmica 32 (2002), no. 4, 521-539. (Yu. G. Stoyan) 2002j:90060 90C27 (68W40, 94A60)
Sen, Sephali (with Mazumdar, N. C.) ...
High Energy Phys. 2001, no. 11, Paper 35, 32 pp. (Marcos Marifio) 2002m:81218 81T30 (81T70)
— Fundamental strings in open string theory at the tachyonic vacuum. ...
Page 1174 of Mathematical Reviews Vol. , Issue Author Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) Algorithmica 30 (2001), no. 2, 287-301. 68U05 (65D18)
lé ba Long see Lé ba Long
nguyen thanh Long see Nguyen Thanh Long
Long, Calvin T. ...
J. 32 (2001), no. 2, 135-137. 11B25
Long, D. D. (with Cooper, Daryl) Virtually Haken Dehn-filling. (English summary) J. Differential Geom. §2 (1999), no. 1, 173-187. (Danny C. ...
Chapter 5. Realistic Computer Models
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
NASA already measures the data volumes from satellite images in petabytes (10 15 bytes). ...
, External memory data structures, ESA 2001 (Friedhelm Meyer auf der
Heide, ed.), LNCS, vol. 2161, Springer, Heidelberg, 2001, pp. 1-29.
37. ...
doi:10.1007/978-3-642-14866-8_5
fatcat:j326q2ymeffzfmo36nqst7msmq
Page 560 of Mathematical Reviews Vol. , Issue Author Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
A new volume of fluid advection algorithm: the stream scheme. (English summary) J. Comput. Phys. 162 (2000), no. 1, 1-32. (Summary) 2001¢:76095 76M25
Fletcher, G. J. (with Bruce, J. W.; Tari, F.) ...
OR Spektrum 23 (2001), no. 1, 25-50. (see 20011:90009) 91838 (90B30)
Fleischmann, Peter The Noether bound in invariant theory of finite groups. (English summary) Adv. Math. 156 (2000), no. 1, 23-32. ...
Page 1770 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) Algorithmica 32 (2002), no. 2, 302-343. (Seok-Hee Hong) 2003¢:68253 68W25 (05C85,
AUTHOR INDEX
68Q25, 68R10, 68W20)
— (with Bender, Michael A.; Fernandez, Antonio! ...
Rao 80th birthday felicitation volume, Part I. J. Statist. Plann. Inference 103 (2002), no. 1-2, 287-310. ...
« Previous
Showing results 1 — 15 out of 139 results