190 search results - page 14 / 38 » Improved Algorithm for the Soft Global Cardinality Constrain... |
ICCD
2007
IEEE
15 years 6 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
62
Voted
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
— Fixed-die floorplanning is an important problem in the modern physical design process. An effective floorplanning algorithm is crucial to improving both the quality and the t...
AIMSA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
COMCOM
2004
14 years 9 months ago
2004
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
121
click to vote
TASE
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...