Sciweavers

414 search results - page 67 / 83
» Integer Linear Programming Models for Global Routing
Sort
View
CP
2007
Springer
14 years 1 months ago
A Generic Geometrical Constraint Kernel in Space and Time for Handling Polymorphic k-Dimensional Objects
: This report introduces a geometrical constraint kernel for handling the location in space and time of polymorphic k-dimensional objects subject to various geometrical and time co...
Nicolas Beldiceanu, Mats Carlsson, Emmanuel Poder,...
EMMCVPR
2005
Springer
14 years 1 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
ASPDAC
2010
ACM
163views Hardware» more  ASPDAC 2010»
13 years 5 months ago
A3MAP: architecture-aware analytic mapping for networks-on-chip
- In this paper, we propose a novel and global A3MAP (Architecture-Aware Analytic Mapping) algorithm applied to NoC (Networks-on-Chip) based MPSoC (Multi-Processor System-on-Chip) ...
Wooyoung Jang, David Z. Pan
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
14 years 7 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
CGO
2005
IEEE
14 years 1 months ago
A Progressive Register Allocator for Irregular Architectures
Register allocation is one of the most important optimizations a compiler performs. Conventional graphcoloring based register allocators are fast and do well on regular, RISC-like...
David Koes, Seth Copen Goldstein