837 search results - page 52 / 168 » Hard combinators |
109
click to vote
TAMC
2010
Springer
15 years 4 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...
102
click to vote
DAC
2008
ACM
16 years 25 days ago
2008
ACM
In this paper, we present DeFer -- a fast, high-quality and nonstochastic fixed-outline floorplanning algorithm. DeFer generates a non-slicing floorplan by compacting a slicing fl...
SIGSOFT
2004
ACM
16 years 17 days ago
2004
ACM
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
113
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Recognizing texts from camera images is a known hard problem because of the difficulties in text segmentation from the varied and complicated backgrounds. In this paper, we propo...
112
click to vote
EMSOFT
2007
Springer
15 years 6 months ago
2007
Springer
The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly...