4372 search results - page 263 / 875 » Algorithmic Theories of Everything |
194
Voted
STOC
2006
ACM
16 years 6 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
138
click to vote
ICCAD
2006
IEEE
16 years 2 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
137
click to vote
LATA
2010
Springer
16 years 24 days ago
2010
Springer
The smallest grammar problem - namely, finding a smallest context-free grammar that generates exactly one sequence - is of practical and theoretical importance in fields such as ...
159
click to vote
ALDT
2009
Springer
16 years 17 days ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
160
click to vote
IPPS
2007
IEEE
16 years 8 days ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...