Sciweavers

3838 search results - page 364 / 768
» Techniques for Optimization of Net Algorithms
Sort
View
183
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
16 years 1 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 8 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
GenClust: A genetic algorithm for clustering gene expression data
Background: Clustering is a key step in the analysis of gene expression data, and in fact, many classical clustering algorithms are used, or more innovative ones have been designe...
Vito Di Gesù, Raffaele Giancarlo, Giosu&egr...
ICCAD
2006
IEEE
112views Hardware» more  ICCAD 2006»
16 years 3 months ago
A new RLC buffer insertion algorithm
Most existing buffering algorithms neglect the impact of inductance on circuit performance, which causes large error in circuit analysis and optimization. Even for the approaches...
Zhanyuan Jiang, Shiyan Hu, Jiang Hu, Zhuo Li, Weip...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
15 years 8 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee