1983 search results - page 19 / 397 » Competitive graph searches |
DAC
2005
ACM
14 years 8 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
JCDL
2010
ACM
13 years 9 months ago
2010
ACM
We present a new algorithm to measure domain-specific readability. It iteratively computes the readability of domainspecific resources based on the difficulty of domain-specific c...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...
DAM
2011
13 years 2 months ago
2011
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...