14161 search results - page 434 / 2833 » On generalized middle-level problem |
160
click to vote
CEC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
174
click to vote
TACAS
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Many important problems in bioinformatics and genetics require analyses that are NP-complete. For example, one of the basic problems facing researchers that analyze pedig...
203
click to vote
MFCS
2005
Springer
16 years 9 days ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
175
click to vote
IBERAMIA
2004
Springer
16 years 6 days ago
2004
Springer
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
176
click to vote
CEC
2003
IEEE
16 years 3 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...