2523 search results - page 315 / 505 » Objective: In Minimum Context |
165
click to vote
CP
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
139
click to vote
EPIA
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we propose a hybrid system that bridges the gap between traditional image processing methods, used for low-level object recognition, and abductive constraint logic pr...
180
click to vote
ECCV
1998
Springer
15 years 9 months ago
1998
Springer
Different applications in the field of vision-based navigation of autonomous mobile robots depend on the degree of knowledge of the environment. Indoor environment applications oft...
187
click to vote
PODS
1994
ACM
15 years 9 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
141
click to vote
BMCBI
2006
15 years 5 months ago
2006
Background: The identification of a consensus RNA motif often consists in finding a conserved secondary structure with minimum free energy in an ensemble of aligned sequences. How...