Sciweavers

255 search results - page 39 / 51
» Approximate Tree Embedding Problem - An Algebraic Approach
Sort
View
ICMLA
2008
13 years 9 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
ECRTS
2005
IEEE
14 years 1 months ago
Task Assignment on Uniform Heterogeneous Multiprocessors
The partitioning of periodic task systems upon uniform multiprocessors is considered. In the partitioned approach to scheduling periodic tasks upon multiprocessors, each task is a...
Shelby Funk, Sanjoy K. Baruah
FOCS
2006
IEEE
14 years 1 months ago
Algorithms on negatively curved spaces
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
Robert Krauthgamer, James R. Lee
WINE
2007
Springer
166views Economy» more  WINE 2007»
14 years 1 months ago
Gradient-Based Algorithms for Finding Nash Equilibria in Extensive Form Games
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
Andrew Gilpin, Samid Hoda, Javier Peña, Tuo...
GECCO
2003
Springer
14 years 21 days ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell