3514 search results - page 11 / 703 » A search space |
115
Voted
ICDCS
1999
IEEE
15 years 5 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
108
Voted
GLVLSI
2009
IEEE
15 years 7 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
96
Voted
ISCIS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
112
click to vote
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noiseless function testbed. The CMA-EGS is a hybrid strategy which combines elements from grad...
79
Voted
ICIAR
2004
Springer
15 years 6 months ago
2004
Springer
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....