5022 search results - page 204 / 1005 » Data structures and problem solving using Java |
116
click to vote
ICCD
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
109
click to vote
ASPDAC
2001
ACM
15 years 5 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
122
click to vote
PPL
2010
14 years 9 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
94
Voted
CP
2004
Springer
15 years 7 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
112
Voted
ACSC
2003
IEEE
15 years 7 months ago
2003
IEEE
The purpose of this paper is to describe in detail the current development status of the innovative Environment for Learning to Program (ELP) which provides an interactive web-bas...