Sciweavers

2917 search results - page 268 / 584
» Satisfying Interaction Constraints
Sort
View
ICSE
2000
IEEE-ACM
15 years 10 months ago
Software configuration management: a roadmap
This paper, in the first chapter summarizes the state of the art in SCM, showing the evolution along the last 25 years. Chapter 2 shows the current issues and current research wor...
Jacky Estublier
CPAIOR
2010
Springer
15 years 10 months ago
Hybrid Methods for the Multileaf Collimator Sequencing Problem
Abstract. The multileaf collimator sequencing problem is an important component of the effective delivery of intensity modulated radiotherapy used in the treatment of cancer. The p...
Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan
ASPDAC
2008
ACM
150views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Constraint-free analog placement with topological symmetry structure
Abstract-- In analog circuits, blocks need to be placed symmetrically to satisfy the devices matching. Different from the existing constraint-driven approaches, the proposed topolo...
Qing Dong, Shigetoshi Nakatake
ASPDAC
2008
ACM
92views Hardware» more  ASPDAC 2008»
15 years 8 months ago
Design space exploration for a coarse grain accelerator
- In the design process of a reconfigurable accelerator employing in an embedded system, multitude parameters may result in remarkable complexity and a large design space. Design s...
Farhad Mehdipour, Hamid Noori, Morteza Saheb Zaman...
APPROX
2008
Springer
137views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Directed Weighted-Degree Constrained Networks
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
Zeev Nutov