Sciweavers

342 search results - page 27 / 69
» Constrained Integer Partitions
Sort
View
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
14 years 8 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
ISCAS
2005
IEEE
129views Hardware» more  ISCAS 2005»
14 years 2 months ago
Partitioning graphs of supply and demand
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
CC
2007
Springer
126views System Software» more  CC 2007»
14 years 2 months ago
An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architectures
This paper presents a compiler technique that reduces the energy consumption of the memory subsystem, for an off-chip partitioned memory architecture having multiple memory banks ...
K. Shyam, R. Govindarajan
ISCAS
2007
IEEE
135views Hardware» more  ISCAS 2007»
14 years 2 months ago
Diophantine Frequency Synthesis The Mathematical Principles
— Diophantine Frequency Synthesis1 is a new approach to fine-step and fast-hopping frequency synthesis that is based on mathematical properties of integer numbers and Diophantin...
Paul-Peter Sotiriadis
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
14 years 3 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés