708 search results - page 76 / 142 » Computational Law |
TACAS
2007
Springer
15 years 6 months 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...
105
click to vote
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
ISCAS
2006
IEEE
15 years 5 months ago
2006
IEEE
—Sliding mode control (SMC) has a strong capability of controlling nonlinear systems with uncertainties. However, it requires thorough knowledge of parameters and dynamics of the...
102
click to vote
SEW
2006
IEEE
15 years 5 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper we present a methodology that drives and stabilizes a robotic agent moving in a three dimensional environment, to a 2-dimensional manifold embedded in the workspa...