3367 search results - page 79 / 674 » Incremental assignment problem |
126
click to vote
JETC
2008
15 years 1 months ago
2008
With aggressive reductions in feature sizes and the integration of multiple functionalities on the same die, bottlenecks due to I/O pin limitations have become a severe issue in to...
120
Voted
FLAIRS
2006
15 years 4 months ago
2006
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
149
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
136
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
124
Voted
DATE
2000
IEEE
15 years 7 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...