3250 search results - page 22 / 650 » An Algorithm to Solve a Linear Program |
ICFP
2000
ACM
15 years 6 months ago
2000
ACM
ÁÒ Ø × Ô Ô Ö Û ÔÖÓÔÓ× Ò Û Ñ Ø Ó ÓÖ Ö Ú Ò ÔÖ Ø ¹ Ð Ð Ò Ö¹Ø Ñ Ð ÓÖ Ø Ñ ÖÓÑ Ø ×Ô ¬ Ø ÓÒ Ó Ñ Ü ÑÙÑ¹Û Ø×ÙÑ ÔÖÓ Ð Ñ Ö...
124
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
113
click to vote
SC
2009
ACM
15 years 8 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
106
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...
134
Voted
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...