Sciweavers

2542 search results - page 289 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
126
Voted
STACS
2010
Springer
15 years 5 months ago
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
Abstract. In the constraint satisfaction problem (CSP), the aim is to find an assignment of values to a set of variables subject to specified constraints. In the minimum cost hom...
Rustem Takhanov
98
Voted
DAC
2010
ACM
15 years 4 months ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
119
Voted
DAC
2005
ACM
15 years 2 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
133
Voted
CEC
2010
IEEE
15 years 1 months ago
Applying cooperative coevolution to compete in the 2009 TORCS Endurance World Championship
The TORCS Endurance World Championship is an international competition in which programmers develop and tune their drivers to race against each other using TORCS, a state-of-the-ar...
Luigi Cardamone, Daniele Loiacono, Pier Luca Lanzi
107
Voted
CONEXT
2009
ACM
15 years 1 months ago
SWARM: the power of structure in community wireless mesh networks
Community wireless networks (CWNs) have been proposed to spread broadband network access to underprivileged, underprovisioned and remote areas. Research has focused on optimizing ...
Saumitra M. Das, Konstantina Papagiannaki, Suman B...