14165 search results - page 419 / 2833 » The generalized two-server problem |
162
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— The problem of safe locomotion of legged and wheeled robots, when trying to avoid falling, tipping over or hitting obstacles, appears to be a problem of viability and not of Ly...
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...
174
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...